Cody

Solution 1942138

Submitted on 19 Sep 2019 at 1:49 by Augusto Mazzei
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
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 1; i = consecutiveFind(v, n); i_correct = 2; assert(isequal(i, i_correct))

d = 0 1 1 0 0 1 1 1 1 1 0 i = 2

2   Pass
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 4; i = consecutiveFind(v, n); i_correct = 6; assert(isequal(i, i_correct))

d = 2 2 2 2 3 4 4 3 2 1 0 i = 6

3   Pass
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); n = 6; i = consecutiveFind(v, n); assert(isempty(i))

d = 3 4 4 4 5 5 4 3 2 1 0 i = 1×0 empty double row vector

4   Pass
v = false(1, 10); n = 1; i = consecutiveFind(v, n); assert(isempty(i))

d = 0 0 0 0 0 0 0 0 0 0 i = 1×0 empty double row vector

5   Pass
x = 0 : pi/4 : 2*pi; v = sin(x) < 1; n = 5; i = consecutiveFind(v, n); i_correct = 4; assert(isequal(i, i_correct))

d = 4 4 4 5 5 4 3 2 1 i = 4

Suggested Problems

More from this Author25