Cody

# Problem 15. Find the longest sequence of 1's in a binary sequence.

Solution 1982973

Submitted on 19 Oct 2019 by Cheng Ye
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
x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

ascii = 48 n = 1 m = 0 y = 0

2   Pass
x = '1'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

ascii = 49 n = 1 m = 1 y = 1

3   Pass
x = '01'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

ascii = 48 49 n = 1 m = 1 n = 1 y = 1

4   Pass
x = '10'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

ascii = 49 48 n = 1 m = 1 n = 1 y = 1

5   Pass
x = '00'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

ascii = 48 48 n = 1 m = 0 n = 1 y = 0

6   Pass
x = '11'; y_correct = 2; assert(isequal(lengthOnes(x),y_correct))

ascii = 49 49 n = 1 n = 2 m = 2 y = 2

7   Pass
x = '1111111111'; y_correct = 10; assert(isequal(lengthOnes(x),y_correct))

ascii = 49 49 49 49 49 49 49 49 49 49 n = 1 n = 2 m = 2 n = 3 m = 2 3 n = 4 m = 2 3 4 n = 5 m = 2 3 4 5 n = 6 m = 2 3 4 5 6 n = 7 m = 2 3 4 5 6 7 n = 8 m = 2 3 4 5 6 7 8 n = 9 m = 2 3 4 5 6 7 8 9 n = 10 m = 2 3 4 5 6 7 8 9 10 y = 10

8   Pass
x = '100101011111010011111'; y_correct = 5; assert(isequal(lengthOnes(x),y_correct))

ascii = 49 48 48 49 48 49 48 49 49 49 49 49 48 49 48 48 49 49 49 49 49 n = 1 m = 1 n = 1 m = 1 1 n = 1 m = 1 1 1 n = 1 m = 1 1 1 1 n = 1 m = 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 n = 1 n = 2 m = 1 1 1 1 1 1 1 2 n = 3 m = 1 1 1 1 1 1 1 2 3 n = 4 m = 1 1 1 1 1 1 1 2 3 4 n = 5 m = 1 1 1 1 1 1 1 2 3 4 5 m = 1 1 1 1 1 1 1 2 3 4 5 1 n = 1 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 1 n = 1 n = 2 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 1 2 n = 3 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 1 2 3 n = 4 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 1 2 3 4 n = 5 m = 1 1 1 1 1 1 1 2 3 4 5 1 1 1 1 1 2 3 4 5 y = 5

9   Pass
x = '01010101010101010101010101'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))

ascii = 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 48 49 n = 1 m = 1 n = 1 m = 1 1 n = 1 m = 1 1 1 n = 1 m = 1 1 1 1 n = 1 m = 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n = 1 y = 1

10   Pass
x = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'; y_correct = 4; assert(isequal(lengthOnes(x),y_correct))

ascii = Columns 1 through 30 48 49 48 49 48 49 48 49 49 49 48 48 48 49 48 49 49 49 48 48 48 49 48 49 49 49 48 48 48 49 Columns 31 through 60 48 49 48 48 48 48 49 49 49 48 49 49 48 49 48 48 48 48 48 48 48 48 49 49 48 48 48 49 48 48 Columns 61 through 90 49 48 48 48 48 48 49 49 49 48 48 48 49 48 48 48 49 49 49 48 49 48 49 48 49 48 48 49 49 48 Columns 91 through 100 49 49 48 48 48 48 49 49 49 49 n = 1 m = 1 n = 1 m = 1 1 n = 1 m = 1 1 1 n = 1 m = 1 1 1 1 n = 1 m = 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 n = 1 n = 2 m = 1 1 1 1 1 1 1 2 n = 3 m = 1 1 1 1 1 1 1 2 3 m = 1 1 1 1 1 1 1 2 3 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 n = 1 n = 2 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 n = 3 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 n = 1 n = 2 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 n = 3 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 n = 1 m = 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Column 31 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 32 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 33 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 34 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 35 1 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 36 1 1 1 1 1 1 n = 1 n = 2 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 37 1 1 1 1 1 1 2 n = 3 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 38 1 1 1 1 1 1 2 3 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 39 1 1 1 1 1 1 2 3 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 40 1 1 1 1 1 1 2 3 1 1 n = 1 n = 2 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 41 1 1 1 1 1 1 2 3 1 1 2 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 42 1 1 1 1 1 1 2 3 1 1 2 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 43 1 1 1 1 1 1 2 3 1 1 2 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 44 1 1 1 1 1 1 2 3 1 1 2 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 45 1 1 1 1 1 1 2 3 1 1 2 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 46 1 1 1 1 1 1 2 3 1 1 2 1 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 47 1 1 1 1 1 1 2 3 1 1 2 1 1 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 48 1 1 1 1 1 1 2 3 1 1 2 1 1 1 1 1 1 1 n = 1 m = Columns 1 through 30 1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 1 2 3 1 1 1 1 1 Columns 31 through 49 1 1 ...