Cody

# Problem 672. Longest run of consecutive numbers

Solution 1203480

Submitted on 3 Jun 2017 by Chris Cleveland
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))

size_a = 1 11 i = 1 4 5 6 7 8 9 10 n = 1 3 1 1 1 1 1 1 1 z = 1 2 1 3 2 1 4 5 1 y = 3 2 1 1 1 1 1 3 1 2 1 1 1 4 1 5 1 1 v = 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))

size_a = 1 9 i = 3 6 n = 3 3 3 z = 1 2 3 y = 3 1 3 2 3 3 v = 3 val = 1 2 3

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

size_a = 1 7 i = 4 5 6 n = 4 1 1 1 z = -2 -1 0 3 y = 4 -2 1 -1 1 0 1 3 v = 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))

size_a = 1 12 i = 1 4 5 7 8 11 n = 1 3 1 2 1 3 1 z = 0 1 0 2 0 1 0 y = 3 1 3 1 2 2 1 0 1 0 1 0 1 0 v = 2 val = 1 1

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

size_a = 7 1 flag = 1 i = 3 5 6 n = 3 2 1 1 z = 3 2 1 6 y = 3 3 2 2 1 1 1 6 v = 1 val = 3

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

size_a = 8 1 flag = 1 i = 3 6 7 n = 3 3 1 1 z = 3 2 1 6 y = 3 3 3 2 1 1 1 6 v = 2 val = 3 2

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

size_a = 5 1 flag = 1 i = 1 2 3 4 n = 1 1 1 1 1 z = 1 2 3 4 5 y = 1 1 1 2 1 3 1 4 1 5 v = 5 val = 1 2 3 4 5