31 Next Permutation

听说这是一道经典题目，不过我没什么思路，看答案也不是那么容易懂。。。比较好的解释是 http://www.geeksforgeeks.org/find-next-greater-number-set-digits/

我的代码是根据以上分析写的.代码有些冗长，好几次才通过。主要是卡在把最后一部分排序的地方，犯了不少低级错误。

public class Solution {
    public void nextPermutation(int[] nums) {
        if (nums == null || nums.length < 0) {
            return;
        }

        int pointer = -1;
        for (int i = nums.length - 1; i >= 1; i--) { // i = 2
            if (nums[i] > nums[i - 1]) { 
                pointer = i - 1;
                break;
            }
        }

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

        int smallest = -1;
        for (int i = nums.length - 1; i > pointer; i--) {
            if (nums[i] > nums[pointer]) {
                smallest = i;
                break;
            }
        }

        swap(nums, pointer, smallest);

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

    public void swap(int[] nums, int num1, int num2) {
        int temp = nums[num1];
        nums[num1] = nums[num2]; 
        nums[num2] = temp;
    }
}