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 Solvers63
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
481 Solvers
-
475 Solvers
-
519 Solvers
-
Find the index of n in magic(n)
272 Solvers
-
756 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.