Cody

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

Solution 232209

Submitted on 18 Apr 2013 by Lorenzo
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 = [] y = 0

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

y = 1

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

y = 2

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

y = 1

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

y = [] y = 0

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

y = 1 2 a = 2

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

y = 1 2 3 4 5 6 7 8 9 10 a = 2 a = 3 a = 4 a = 5 a = 6 a = 7 a = 8 a = 9 a = 10

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

y = 1 4 6 8 9 10 11 12 14 17 18 19 20 21 a = 2 a = 3 a = 4 a = 5 a = 2 a = 3 a = 4 a = 5 y = 5 y = 5

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

y = 2 4 6 8 10 12 14 16 18 20 22 24 26

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

y = Columns 1 through 16 2 4 6 8 9 10 14 16 17 18 22 24 25 26 30 32 Columns 17 through 32 37 38 39 41 42 44 53 54 58 61 67 68 69 73 77 78 Columns 33 through 44 79 81 83 85 88 89 91 92 97 98 99 100 a = 2 a = 3 a = 2 a = 3 a = 2 a = 3 a = 2 a = 3 a = 2 a = 2 a = 2 a = 3 a = 2 a = 3 a = 2 a = 2 a = 2 a = 3 a = 4 y = 3 y = 3 y = 3 y = 3 y = 2 y = 2 y = 3 y = 3 y = 2 y = 2 y = 4

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!