Cody

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

Solution 594891

Submitted on 11 Mar 2015 by Alexander Razmyslov
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 = {} V = [] y = [] y = 0

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

y = '1' V = 1 y = 1 y = 1

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

y = '1' V = 2 y = 1 y = 1

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

y = '1' V = 1 y = 1 y = 1

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

y = {} V = [] y = [] y = 0

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

y = '11' V = 1 y = 2 y = 2

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

y = '1111111111' V = 1 y = 10 y = 10

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

y = '1' '1' '1' '11111' '1' '11111' V = 1 4 6 8 14 17 y = 5 y = 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' V = 2 4 6 8 10 12 14 16 18 20 22 24 26 y = 1 y = 1

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

y = Columns 1 through 12 '1' '1' '1' '111' '1' '111' '1' '111' '1' '1' '111' '11' Columns 13 through 24 '1' '11' '1' '1' '111' '1' '111' '1' '1' '1' '11' '11' Column 25 '1111' V = Columns 1 through 16 2 4 6 8 14 16 22 24 30 32 37 41 44 53 58 61 Columns 17 through 25 67 73 77 81 83 85 88 91 97 y = 4 y = 4