Cody

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

Solution 256484

Submitted on 6 Jun 2013 by Franek
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))

x = {''}

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

x = '1'

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

x = '' '1'

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

x = '1'

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

x = '' ''

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

x = '11'

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

x = '1111111111'

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

x = '1' '' '1' '1' '11111' '1' '' '11111'

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

x = '' '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))

x = '' '1' '1' '1' '111' '' '' '1' '111' '' '' '1' '111' '' '' '1' '1' '' '' '' '111' '11' '1' '' '' '' '' '' '' '' '11' '' '' '1' '' '1' '' '' '' '' '111' '' '' '1' '' '' '111' '1' '1' '1' '' '11' '11' '' '' '' '1111'