You are given a binary array nums.
You can do the following operation on the array any number of times (possibly zero):
i from the array and flip all the elements from index i to the end of the array.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.
Example 1:
Input: nums = [0,1,1,0,1]
Output: 4
Explanation:
We can do the following operations:
i = 1. The resulting array will be nums = [0,0,0,1,0].i = 0. The resulting array will be nums = [1,1,1,0,1].i = 4. The resulting array will be nums = [1,1,1,0,0].i = 3. The resulting array will be nums = [1,1,1,1,1].Example 2:
Input: nums = [1,0,0,0]
Output: 1
Explanation:
We can do the following operation:
i = 1. The resulting array will be nums = [1,1,1,1].
Constraints:
1 <= nums.length <= 1050 <= nums[i] <= 1Solutions for this problem are being prepared.
Try solving it yourselfMinimum Operations to Make Array Equal | Leetcode - 1551 • Algorithms Made Easy • 24,165 views views
Watch 9 more video solutions →Practice Minimum Operations to Make Binary Array Elements Equal to One II with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor