Cody

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

Solution 598302

Submitted on 18 Mar 2015 by Marco Wassmer
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))

temp = 0 0 s = 1 y = 0

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

temp = 1 s = 1 y = 1

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

temp = 0 1 s = 2 y = 1

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

temp = 1 0 s = 1 y = 1

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

temp = 0 0 s = 1 y = 0

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

temp = 2 s = 1 y = 2

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

temp = 10 s = 1 y = 10

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

temp = 1 1 1 5 1 5 s = 4 y = 5

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

temp = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 s = 2 y = 1

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

temp = Columns 1 through 16 0 1 1 1 3 1 3 1 3 1 1 3 2 1 2 1 Columns 17 through 26 1 3 1 3 1 1 1 2 2 4 s = 26 y = 4