Minimum Operations to Make Binary Array Elements Equal to One I
You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
- Choose any 3 consecutive elements from the array and flip all of them.
Flipping an element means changing its value from 0 to 1, and from 1 to 0.
Return the minimum number of operations required to make all elements in nums equal to 1. If it is impossible, return -1.
Example 1
Input
nums = [0,1,1,1,0,0]Output
3By flipping indices 0 to 2, then 1 to 3, then 3 to 5, all elements become 1 in 3 operations.
Example 2
Input
nums = [0,1,1,1]Output
-1It is impossible to make all elements equal to 1.
Constraints
- 3 <= nums.length <= 10^5
- 0 <= nums[i] <= 1