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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15798 Solvers
-
Given two arrays, find the maximum overlap
1775 Solvers
-
How to find the position of an element in a vector without using the find function
2816 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1322 Solvers
-
Test if two numbers have the same digits
266 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.