Cody

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

Solution 667753

Submitted on 7 May 2015 by Meade
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))

temp1 = '' '' temp2 = 0 0 y = 0

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

temp1 = '1' temp2 = 1 y = 1

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

temp1 = '' '1' temp2 = 0 1 y = 1

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

temp1 = '1' '' temp2 = 1 0 y = 1

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

temp1 = '' '' temp2 = 0 0 y = 0

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

temp1 = '11' temp2 = 2 y = 2

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

temp1 = '1111111111' temp2 = 10 y = 10

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

temp1 = '1' '1' '1' '11111' '1' '11111' temp2 = 1 1 1 5 1 5 y = 5

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

temp1 = '' '1' '1' '1' '1' '1' '1' '1' '1' '1' '1' '1' '1' '1' temp2 = 0 1 1 1 1 1 1 1 1 1 1 1 1 1 y = 1

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

temp1 = '' '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' temp2 = 0 1 1 1 3 1 3 1 3 1 1 3 2 1 2 1 1 3 1 3 1 1 1 2 2 4 y = 4

Suggested Problems

More from this Author95