Maximum Number of Operations to Move Ones to the End
You are given a binary string s.
You can perform the following operation on the string any number of times:
- Choose any index
ifrom the string wherei + 1 < s.lengthsuch thats[i] == '1'ands[i + 1] == '0'. - Move the character
s[i]to the right until it reaches the end of the string or another'1'.
Return the maximum number of operations that you can perform.
Example 1
Input
s = "1001101"Output
4By repeatedly moving eligible
1 characters to the right, the maximum number of operations that can be performed is 4.Example 2
Input
s = "00111"Output
0There is no index
i where s[i] == '1' and s[i + 1] == '0', so no operations can be performed.Constraints
- 1 <= s.length <= 10^5
- s[i] is either '0' or '1'.