Cody

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

Solution 1629798

Submitted on 18 Sep 2018 by Bob Tivnan
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))

A = [] n = 0 A = 0 n = 0 A = 0 0 y = 0

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

A = [] n = 0 n = 1 A = 1 y = 1

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

A = [] n = 0 A = 0 n = 0 n = 1 A = 0 1 y = 1

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

A = [] n = 0 n = 1 A = 1 n = 0 A = 1 0 y = 1

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

A = [] n = 0 A = 0 n = 0 A = 0 0 n = 0 A = 0 0 0 y = 0

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

A = [] n = 0 n = 1 n = 2 A = 2 y = 2

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

A = [] n = 0 n = 1 n = 2 n = 3 n = 4 n = 5 n = 6 n = 7 n = 8 n = 9 n = 10 A = 10 y = 10

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

A = [] n = 0 n = 1 A = 1 n = 0 A = 1 0 n = 0 n = 1 A = 1 0 1 n = 0 n = 1 A = 1 0 1 1 n = 0 n = 1 n = 2 n = 3 n = 4 n = 5 A = 1 0 1 1 5 n = 0 n = 1 A = 1 0 1 1 5 1 n = 0 A = 1 0 1 1 5 1 0 n = 0 n = 1 n = 2 n = 3 n = 4 n = 5 A = 1 0 1 1 5 1 0 5 y = 5

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

A = [] n = 0 A = 0 n = 0 n = 1 A = 0 1 n = 0 n = 1 A = 0 1 1 n = 0 n = 1 A = 0 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 1 1 1 1 n = 0 n = 1 A = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1

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

A = [] n = 0 A = 0 n = 0 n = 1 A = 0 1 n = 0 n = 1 A = 0 1 1 n = 0 n = 1 A = 0 1 1 1 n = 0 n = 1 n = 2 n = 3 A = 0 1 1 1 3 n = 0 A = 0 1 1 1 3 0 n = 0 A = 0 1 1 1 3 0 0 n = 0 n = 1 A = 0 1 1 1 3 0 0 1 n = 0 n = 1 n = 2 n = 3 A = 0 1 1 1 3 0 0 1 3 n = 0 A = 0 1 1 1 3 0 0 1 3 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 n = 0 n = 1 A = 0 1 1 1 3 0 0 1 3 0 0 1 n = 0 n = 1 n = 2 n = 3 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 n = 0 n = 1 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 n = 0 n = 1 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 n = 0 n = 1 n = 2 n = 3 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 n = 0 n = 1 n = 2 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 n = 0 n = 1 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 n = 0 A = 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 n = 0 n = 1 n = 2 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Column 31 2 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 32 2 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 33 2 0 0 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 34 2 0 0 1 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 35 2 0 0 1 0 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 36 2 0 0 1 0 1 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 37 2 0 0 1 0 1 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 38 2 0 0 1 0 1 0 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 39 2 0 0 1 0 1 0 0 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 40 2 0 0 1 0 1 0 0 0 0 n = 0 n = 1 n = 2 n = 3 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 41 2 0 0 1 0 1 0 0 0 0 3 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 42 2 0 0 1 0 1 0 0 0 0 3 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 43 2 0 0 1 0 1 0 0 0 0 3 0 0 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 44 2 0 0 1 0 1 0 0 0 0 3 0 0 1 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 45 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 n = 0 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 46 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 0 n = 0 n = 1 n = 2 n = 3 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 47 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 0 3 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 48 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 0 3 1 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 3 0 0 1 3 0 0 1 1 0 0 0 3 2 1 0 0 0 0 0 0 0 Columns 31 through 49 2 0 0 1 0 1 0 0 0 0 3 0 0 1 0 0 3 1 1 n = 0 n = 1 A = Columns 1 through 30 0 1 1 1 3 0 0 1 ...