Skip to content

Latest commit

 

History

History
 
 

Maximum Binary String After Change

1702. Maximum Binary String After Change

You are given a binary string binary consisting of only 0's or 1's. You can apply each of the following operations any number of times:

  • Operation 1: If the number contains the substring "00", you can replace it with "10".
    <ul>
    	<li>For example, <code>"<u>00</u>010" -&gt; "<u>10</u>010</code>"</li>
    </ul>
    </li>
    <li>Operation 2: If the number contains the substring <code>"10"</code>, you can replace it with <code>"01"</code>.
    <ul>
    	<li>For example, <code>"000<u>10</u>" -&gt; "000<u>01</u>"</code></li>
    </ul>
    </li>
    

Return the maximum binary string you can obtain after any number of operations. Binary string x is greater than binary string y if x's decimal representation is greater than y's decimal representation.

 

Example 1:

Input: binary = "000110"
Output: "111011"
Explanation: A valid transformation sequence can be:
"000110" -> "000101" 
"000101" -> "100101" 
"100101" -> "110101" 
"110101" -> "110011" 
"110011" -> "111011"

Example 2:

Input: binary = "01"
Output: "01"
Explanation: "01" cannot be transformed any further.

 

Constraints:

  • 1 <= binary.length <= 105
  • binary consist of '0' and '1'.