Cody

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

Solution 793231

Submitted on 11 Dec 2015
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   Fail
%% x = '0'; y_correct = 0; assert(isequal(lengthOnes(x),y_correct))

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

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

Subscript indices must either be real positive integers or logicals.

### Community Treasure Hunt

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

Start Hunting!