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

Solution 170920

Submitted on 30 Nov 2012 by li haitao

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	%% x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))
2	Pass	%% x = '1'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))
3	Pass	%% x = '01'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))
4	Pass	%% x = '10'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))
5	Pass	%% x = '00'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))
6	Pass	%% x = '11'; y_correct = 2; assert(isequal(lengthOnes(x),y_correct))
7	Pass	%% x = '1111111111'; y_correct = 10; assert(isequal(lengthOnes(x),y_correct))
8	Pass	%% x = '100101011111010011111'; y_correct = 5; assert(isequal(lengthOnes(x),y_correct))
9	Pass	%% x = '01010101010101010101010101'; y_correct = 1; assert(isequal(lengthOnes(x),y_correct))
10	Pass	%% x = '0101010111000101110001011100010100001110110100000000110001001000001110001000111010101001101100001111'; y_correct = 4; assert(isequal(lengthOnes(x),y_correct))