Cody

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

Solution 2112469

Submitted on 31 Jan 2020 by Chris Brown
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))

Y = 1

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

Y = 1

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

Y = 1 1

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

Y = 1 1

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

Y = 2 2

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

Y = 2 2

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

Y = 10 10 10 10 10 10 10 10 10 10

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

Y = 1 2 2 1 1 1 1 5 5 5 5 5 1 1 2 2 5 5 5 5 5

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

Y = 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 1

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

Y = Columns 1 through 29 1 1 1 1 1 1 1 3 3 3 3 3 3 1 1 3 3 3 3 3 3 1 1 3 3 3 3 3 3 Columns 30 through 58 1 1 1 4 4 4 4 3 3 3 1 2 2 1 1 8 8 8 8 8 8 8 8 2 2 3 3 3 1 Columns 59 through 87 2 2 1 5 5 5 5 5 3 3 3 3 3 3 1 3 3 3 3 3 3 1 1 1 1 1 1 2 2 Columns 88 through 100 2 2 1 2 2 4 4 4 4 4 4 4 4