3192. Minimum Operations to Make Binary Array Elements Equal to One II

題目敘述:

You are given a binary array nums.

You can do the following operation on the array any number of times (possibly zero):

Choose any index 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.

class Solution {
public:
    int minOperations(vector<int>& nums) {
        int i=0;
        int f=0;
        int ans = 0;
        while(i<nums.size())
        {
            if(nums[i] == f%2)
            {
                f++;
                ans++;
            }
            i++;
        }
        return ans;
    }
};