链接:https://leetcode-cn.com/problems/previous-permutation-with-one-swap/
从后往前遍历,当前元素的后面有比它小的元素时,交换此元素与它后面比它小的最大元素。
java代码:
class Solution {
public int[] prevPermOpt1(int[] A) {
int n = A.length;
int min = A[n-1];//当前最小值
int max = A[n-1];//当前最大值
for(int i = n-2;i>=0;i--)
{
if(A[i]>min)
{
int value = 0;//找到需要交换的值
int index = i;
for(int j = i+1;j<n;j++)
{
if(A[j]<A[i]&&A[j]>value)
{
value = A[j];
index = j;
}
}
int temp = A[i];
A[i] = A[index];
A[index] = temp;
break;
}
min = Math.min(min, A[i]);
max = Math.max(max, A[i]);
}
return A;
}
}