Cody

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

Solution 209406

Submitted on 27 Feb 2013 by bartekltg
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))

t = 0 0 0 ind = 0 0 c = 0 0 0 ans = 0

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

t = 0 1 0 ind = 1 1 c = 0 1 1 ans = 1

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

t = 0 0 1 0 ind = 0 1 1 c = 0 0 1 1 ans = 1

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

t = 0 1 0 0 ind = 1 1 0 c = 0 1 1 1 ans = 1

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

t = 0 0 0 0 ind = 0 0 0 c = 0 0 0 0 ans = 0

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

t = 0 1 1 0 ind = 1 0 1 c = 0 1 2 2 ans = 2

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

t = 0 1 1 1 1 1 1 1 1 1 1 0 ind = 1 0 0 0 0 0 0 0 0 0 1 c = 0 1 2 3 4 5 6 7 8 9 10 10 ans = 10

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

t = Columns 1 through 16 0 1 0 0 1 0 1 0 1 1 1 1 1 0 1 0 Columns 17 through 23 0 1 1 1 1 1 0 ind = Columns 1 through 16 1 1 0 1 1 1 1 1 0 0 0 0 1 1 1 0 Columns 17 through 22 1 0 0 0 0 1 c = Columns 1 through 16 0 1 1 1 2 2 3 3 4 5 6 7 8 8 9 9 Columns 17 through 23 9 10 11 12 13 14 14 ans = 5

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

t = Columns 1 through 16 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 Columns 17 through 28 1 0 1 0 1 0 1 0 1 0 1 0 ind = Columns 1 through 16 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 17 through 27 1 1 1 1 1 1 1 1 1 1 1 c = Columns 1 through 16 0 0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 Columns 17 through 28 8 8 9 9 10 10 11 11 12 12 13 13 ans = 1

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

t = Columns 1 through 16 0 0 1 0 1 0 1 0 1 1 1 0 0 0 1 0 Columns 17 through 32 1 1 1 0 0 0 1 0 1 1 1 0 0 0 1 0 Columns 33 through 48 1 0 0 0 0 1 1 1 0 1 1 0 1 0 0 0 Columns 49 through 64 0 0 0 0 0 1 1 0 0 0 1 0 0 1 0 0 Columns 65 through 80 0 0 0 1 1 1 0 0 0 1 0 0 0 1 1 1 Columns 81 through 96 0 1 0 1 0 1 0 0 1 1 0 1 1 0 0 0 Columns 97 through 102 0 1 1 1 1 0 ind = Columns 1 through 16 0 1 1 1 1 1 1 1 0 0 1 0 0 1 1 1 Columns 17 through 32 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1 1 Columns 33 through 48 1 0 0 0 1 0 0 1 1 0 1 1 1 0 0 0 Columns 49 through 64 0 0 0 0 1 0 1 0 0 1 1 0 1 1 0 0 Columns 65 through 80 0 0 1 0 0 1 0 0 1 1 0 0 1 0 0 1 Columns 81 through 96 1 1 1 1 1 1 0 1 0 1 1 0 1 0 0 0 Columns 97 through 101 1 0 0 0 1 c = Columns 1 through 16 0 0 1 1 2 2 3 3 4 5 6 6 6 6 7 7 Columns 17 through 32 8 9 10 10 10 10 11 11 12 13 14 14 14 14 15 15 Columns 33 through 48 16 16 16 16 16 17 18 19 19 20 21 21 22 22 22 22 Columns 49 through 64 22 22 22 22 22 23 24 24 24 24 25 25 25 26 26 26 Columns 65 through 80 26 26 26 27 28 29 29 29 29 30 30 30 30 31 32 33 Columns 81 through 96 33 34 34 35 35 36 36 36 37 38 38 39 40 40 40 40 Columns 97 through 102 40 41 42 43 44 44 ans = 4

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!