Given a logical vector v, and a positive integer n, return the smallest index i that satisfies

Given a logical vector v, and a positive integer n, return the smallest index i that satisfies

all( v(i : i+n-1) ) == true

For Example,

input : v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]);

input : i = consecutiveFind(v, 4);

Then:

output : i = 6

https://jp.mathworks.com/matlabcentral/cody/problems/44500

Answer 1

[yonatan friedman]

i tried this:

for i = length(v)

while i + n -1 < length(v)

if all( v(i : i+n-1) ) == true

disp(sum(v(i:i+n-1)))

end

end

end

but i get 7 every time