Cody

# Problem 672. Longest run of consecutive numbers

Solution 2056254

Submitted on 12 Dec 2019 by kiro avcisi
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
a = [1 2 2 2 1 3 2 1 4 5 1]; y_correct = 2; assert(isequal(longrun(a),y_correct))

t = 1 2 2 2 1 3 2 1 4 5 1 s = 1 1 1 1 1 1 1 1 1 1 1 s = 1 2 1 1 1 1 1 1 1 1 1 s = 1 3 1 1 1 1 1 1 1 1 1 val = 2

2   Pass
a = [1 1 1 2 2 2 3 3 3]; y_correct = [1 2 3]; assert(isequal(longrun(a),y_correct))

t = 1 1 1 2 2 2 3 3 3 s = 1 1 1 1 1 1 1 1 1 s = 2 1 1 1 1 1 1 1 1 s = 3 1 1 1 1 1 1 1 1 s = 3 1 1 2 1 1 1 1 1 s = 3 1 1 3 1 1 1 1 1 s = 3 1 1 3 1 1 2 1 1 s = 3 1 1 3 1 1 3 1 1 val = 1 2 3

3   Pass
a = [-2 -2 -2 -2 -1 0 3]; y_correct = -2; assert(isequal(longrun(a),y_correct))

t = -2 -2 -2 -2 -1 0 3 s = 1 1 1 1 1 1 1 s = 2 1 1 1 1 1 1 s = 3 1 1 1 1 1 1 s = 4 1 1 1 1 1 1 val = -2

4   Pass
a=[0 1 1 1 0 2 2 0 1 1 1 0]; y_correct = [1 1]; assert(isequal(longrun(a),y_correct))

t = 0 1 1 1 0 2 2 0 1 1 1 0 s = 1 1 1 1 1 1 1 1 1 1 1 1 s = 1 2 1 1 1 1 1 1 1 1 1 1 s = 1 3 1 1 1 1 1 1 1 1 1 1 s = 1 3 1 1 1 2 1 1 1 1 1 1 s = 1 3 1 1 1 2 1 1 2 1 1 1 s = 1 3 1 1 1 2 1 1 3 1 1 1 val = 1 1

5   Pass
a=[3 3 3 2 2 1 6]'; y_correct=3; assert(isequal(longrun(a),y_correct))

t = 3 3 3 2 2 1 6 s = 1 1 1 1 1 1 1 s = 2 1 1 1 1 1 1 s = 3 1 1 1 1 1 1 s = 3 1 1 2 1 1 1 val = 3

6   Pass
a=[3 3 3 2 2 2 1 6]'; y_correct=[3 2]'; assert(isequal(longrun(a),y_correct))

t = 3 3 3 2 2 2 1 6 s = 1 1 1 1 1 1 1 1 s = 2 1 1 1 1 1 1 1 s = 3 1 1 1 1 1 1 1 s = 3 1 1 2 1 1 1 1 s = 3 1 1 3 1 1 1 1 val = 3 2

7   Pass
a=[1 2 3 4 5]'; y_correct=a; assert(isequal(longrun(a),y_correct))

t = 1 2 3 4 5 s = 1 1 1 1 1 val = 1 2 3 4 5