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,
v = logical([0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]); i = consecutiveFind(v, 4);
Then:
i = 6
If there is no sequence of n consecutive true, then i should be an empty array.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers64
Suggested Problems
-
2249 Solvers
-
4493 Solvers
-
369 Solvers
-
How many trades represent all the profit?
618 Solvers
-
5371 Solvers
More from this Author25
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The test suite is not enough because it does not contain any case that the number of consecutive true bits is exactly same as n.