Cody

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

Solution 467932

Submitted on 8 Jul 2014 by Nick
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
%% x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

total = 0 y = 0

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

total = 1 str = 1 result = 1 y = 1

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

total = 1 str = 1 result = 2 y = 1

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

total = 1 str = 1 result = 1 y = 1

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

total = 0 y = 0

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

total = 2 str = 11 result = 1 y = 2

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

total = 10 str = 1111111111 result = 1 y = 10

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

total = 14 str = 11111111111111 result = 0 str = 1111111111111 result = 0 str = 111111111111 result = 0 str = 11111111111 result = 0 str = 1111111111 result = 0 str = 111111111 result = 0 str = 11111111 result = 0 str = 1111111 result = 0 str = 111111 result = 0 str = 11111 result = 25 y = 5

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

total = 13 str = 1111111111111 result = 0 str = 111111111111 result = 0 str = 11111111111 result = 0 str = 1111111111 result = 0 str = 111111111 result = 0 str = 11111111 result = 0 str = 1111111 result = 0 str = 111111 result = 0 str = 11111 result = 0 str = 1111 result = 0 str = 111 result = 0 str = 11 result = 0 str = 1 result = 182 y = 1

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

total = 44 str = 1.111111111111111e+43 result = 0 str = 1.111111111111111e+42 result = 0 str = 1.111111111111111e+41 result = 0 str = 1.111111111111111e+40 result = 0 str = 1.111111111111111e+39 result = 0 str = 1.111111111111111e+38 result = 0 str = 1.111111111111111e+37 result = 0 str = 1.111111111111111e+36 result = 0 str = 1.111111111111111e+35 result = 0 str = 1.111111111111111e+34 result = 0 str = 1.111111111111111e+33 result = 0 str = 1.111111111111111e+32 result = 0 str = 1.111111111111111e+31 result = 0 str = 1.111111111111111e+30 result = 0 str = 1.111111111111111e+29 result = 0 str = 1.111111111111111e+28 result = 0 str = 1.111111111111111e+27 result = 0 str = 1.111111111111111e+26 result = 0 str = 1.111111111111111e+25 result = 0 str = 1.111111111111111e+24 result = 0 str = 1.111111111111111e+23 result = 0 str = 1.111111111111111e+22 result = 0 str = 1.111111111111111e+21 result = 0 str = 1.111111111111111e+20 result = 0 str = 1.111111111111111e+19 result = 0 str = 1.111111111111111e+18 result = 0 str = 1.111111111111111e+17 result = 0 str = 1.111111111111111e+16 result = 0 str = 1111111111111111 result = 0 str = 111111111111111 result = 0 str = 11111111111111 result = 0 str = 1111111111111 result = 0 str = 111111111111 result = 0 str = 11111111111 result = 0 str = 1111111111 result = 0 str = 111111111 result = 0 str = 11111111 result = 0 str = 1111111 result = 0 str = 111111 result = 0 str = 11111 result = 0 str = 1111 result = 97 y = 4

Suggested Problems

More from this Author95