Previous Permutation

思路和next permutation一样的。虽然楼主试了好久才让代码通过。。

 public class Solution {
    public ArrayList<Integer> previousPermuation(ArrayList<Integer> nums) {
        ArrayList<Integer> result = new ArrayList<Integer>();

        if (nums == null || nums.size() == 0) {
            return result;
        }

        for (Integer num : nums) {
            result.add(num);
        }

        int pointer = -1;
        for (int i = nums.size() - 1; i >= 1; i--) {
        ／／ 符号更改下
            if (nums.get(i - 1) > nums.get(i)) {
                pointer = i - 1;
                break;
            }
        }

        if (pointer == -1) {
            for (int i = 0; i < nums.size() / 2; i++) {
                swap(result, i, nums.size() - i - 1);
            }
            return result;
        }

        int biggest = -1;
        ／／仍让从后前扫。不过是寻找比pivot大的
        for (int i = nums.size() - 1; i > pointer; i--) {
            if (nums.get(i) < nums.get(pointer)) {
                biggest = i;
                break;
            }
        }

        swap(result, pointer, biggest);

        int start = pointer + 1;

        for (int i = start; i < nums.size(); i++) {
            int end = nums.size() + start - i - 1;
            if (i < end) {
                swap(result, i, end);
            }
        }

        return result;
    }

    public void swap(ArrayList<Integer> nums, int num1, int num2) {
        int temp = nums.get(num1);
        nums.set(num1, nums.get(num2)); 
        nums.set(num2, temp);
    }
}