https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/description/
Given a binary string s, in one second all occurrences of "01" are simultaneously replaced with "10".
Return the number of seconds needed until no "01" remains.
Example
Input: "0110101"











