Minimum Suffix Flips
You are given a 0-indexed binary string target of length n. You have another binary string s of length n that is initially set to all zeros. You want to make s equal to target.
In one operation, you can pick an index i where 0 <= i < n and flip all bits in the inclusive range [i, n - 1]. Flip means changing '0' to '1' and '1' to '0'.
Return the minimum number of operations needed to make s equal to target.
Example 1
Input
target = "10111"Output
3Starting from
s = "00000", flipping suffixes at indices 2, 0, and 1 forms target = "10111", and at least 3 operations are needed.Example 2
Input
target = "101"Output
3Starting from
s = "000", flipping suffixes at indices 0, 1, and 2 forms target = "101", and at least 3 operations are needed.Constraints
- n == target.length
- 1 <= n <= 10^5
- target[i] is either '0' or '1'.