Class Solution
-
- All Implemented Interfaces:
public final class Solution1702 - Maximum Binary String After Change.
Medium
You are given a binary string
binaryconsisting of only0's or1'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".Operation 2: If the number contains the substring
"10", you can replace it with"01".
Return the maximum binary string you can obtain after any number of operations. Binary string
xis greater than binary stringyifx's decimal representation is greater thany'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:
<code>1 <= binary.length <= 10<sup>5</sup></code>
binaryconsist of'0'and'1'.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final StringmaximumBinaryString(String binary)-
-
Method Detail
-
maximumBinaryString
final String maximumBinaryString(String binary)
-
-
-
-