mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
58 lines
1.8 KiB
HTML
58 lines
1.8 KiB
HTML
|
<p>给你一个字符串 <code>num</code> 和一个整数 <code>k</code> 。其中，<code>num</code> 表示一个很大的整数，字符串中的每个字符依次对应整数上的各个 <strong>数位</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p>你可以交换这个整数相邻数位的数字 <strong>最多</strong> <code>k</code> 次。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回你能得到的最小整数，并以字符串形式返回。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/06/17/q4_1.jpg" style="height:40px; width:500px" /></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>num = "4321", k = 4
|
|||
|
|
<strong>输出：</strong>"1342"
|
|||
|
|
<strong>解释：</strong>4321 通过 4 次交换相邻数位得到最小整数的步骤如上图所示。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>num = "100", k = 1
|
|||
|
|
<strong>输出：</strong>"010"
|
|||
|
|
<strong>解释：</strong>输出可以包含前导 0 ，但输入保证不会有前导 0 。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>num = "36789", k = 1000
|
|||
|
|
<strong>输出：</strong>"36789"
|
|||
|
|
<strong>解释：</strong>不需要做任何交换。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 4：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>num = "22", k = 22
|
|||
|
|
<strong>输出：</strong>"22"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 5：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>num = "9438957234785635408", k = 23
|
|||
|
|
<strong>输出：</strong>"0345989723478563548"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= num.length <= 30000</code></li>
|
|||
|
|
<li><code>num</code> 只包含 <strong>数字</strong> 且不含有<strong> 前导 0 </strong>。</li>
|
|||
|
|
<li><code>1 <= k <= 10^9</code></li>
|
|||
|
|
</ul>
|