Cody

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

Solution 1656840

Submitted on 23 Oct 2018 by Wycliff Dembe
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))

C = 1×2 cell array {0×0 char} {0×0 char} ans = 0

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

C = 1×1 cell array {'1'} ans = 1

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

C = 1×2 cell array {0×0 char} {'1'} ans = 1

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

C = 1×2 cell array {'1'} {0×0 char} ans = 1

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

C = 1×2 cell array {0×0 char} {0×0 char} ans = 0

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

C = 1×1 cell array {'11'} ans = 2

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

C = 1×1 cell array {'1111111111'} ans = 10

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

C = 1×6 cell array {'1'} {'1'} {'1'} {'11111'} {'1'} {'11111'} ans = 5

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

C = 1×14 cell array {0×0 char} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} {'1'} ans = 1

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

C = 1×26 cell array Columns 1 through 18 {0×0 char} {'1'} {'1'} {'1'} {'111'} {'1'} {'111'} {'1'} {'111'} {'1'} {'1'} {'111'} {'11'} {'1'} {'11'} {'1'} {'1'} {'111'} Columns 19 through 26 {'1'} {'111'} {'1'} {'1'} {'1'} {'11'} {'11'} {'1111'} ans = 4