mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
39 lines
1.5 KiB
HTML
39 lines
1.5 KiB
HTML
<p><strong>Special binary strings</strong> are binary strings with the following two properties:</p>
|
|
|
|
<ul>
|
|
<li>The number of <code>0</code>'s is equal to the number of <code>1</code>'s.</li>
|
|
<li>Every prefix of the binary string has at least as many <code>1</code>'s as <code>0</code>'s.</li>
|
|
</ul>
|
|
|
|
<p>You are given a <strong>special binary</strong> string <code>s</code>.</p>
|
|
|
|
<p>A move consists of choosing two consecutive, non-empty, special substrings of <code>s</code>, and swapping them. Two strings are consecutive if the last character of the first string is exactly one index before the first character of the second string.</p>
|
|
|
|
<p>Return <em>the lexicographically largest resulting string possible after applying the mentioned operations on the string</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "11011000"
|
|
<strong>Output:</strong> "11100100"
|
|
<strong>Explanation:</strong> The strings "10" [occuring at s[1]] and "1100" [at s[3]] are swapped.
|
|
This is the lexicographically largest string possible after some number of swaps.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "10"
|
|
<strong>Output:</strong> "10"
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 50</code></li>
|
|
<li><code>s[i]</code> is either <code>'0'</code> or <code>'1'</code>.</li>
|
|
<li><code>s</code> is a special binary string.</li>
|
|
</ul>
|