Cody

# Problem 672. Longest run of consecutive numbers

Solution 1418061

Submitted on 16 Jan 2018 by Noriko HOUNOKI
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))

cMax = 1 c = 1 c = 1 cMax = 2 val = 2 cMax = 3 val = 2 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1 c = 1

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

cMax = 1 c = 1 cMax = 2 val = 1 cMax = 3 val = 1 c = 1 val = 1 2 c = 1 val = 1 2 3

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

cMax = 1 c = 1 cMax = 2 val = -2 cMax = 3 val = -2 cMax = 4 val = -2 c = 1 c = 1 c = 1

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))

cMax = 1 c = 1 c = 1 cMax = 2 val = 1 cMax = 3 val = 1 c = 1 c = 1 c = 1 c = 1 val = 1 1 c = 1

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

cMax = 1 c = 1 cMax = 2 val = 3 cMax = 3 val = 3 c = 1 c = 1 c = 1

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

cMax = 1 c = 1 cMax = 2 val = 3 cMax = 3 val = 3 c = 1 val = 3 2 c = 1 c = 1

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