mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
35 lines
1.1 KiB
HTML
35 lines
1.1 KiB
HTML
<p>Given an array of positive integers <code>arr</code> (not necessarily distinct), return <em>the lexicographically largest permutation that is smaller than</em> <code>arr</code>, that can be <strong>made with exactly one swap</strong> (A <em>swap</em> exchanges the positions of two numbers <code>arr[i]</code> and <code>arr[j]</code>). If it cannot be done, then return the same array.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [3,2,1]
|
|
<strong>Output:</strong> [3,1,2]
|
|
<strong>Explanation:</strong> Swapping 2 and 1.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [1,1,5]
|
|
<strong>Output:</strong> [1,1,5]
|
|
<strong>Explanation:</strong> This is already the smallest permutation.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [1,9,4,6,7]
|
|
<strong>Output:</strong> [1,7,4,6,9]
|
|
<strong>Explanation:</strong> Swapping 9 and 7.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= arr.length <= 10<sup>4</sup></code></li>
|
|
<li><code>1 <= arr[i] <= 10<sup>4</sup></code></li>
|
|
</ul>
|