Leetcode - Next Permutation

public class Solution {
    public void nextPermutation(int[] num) {
        int i = num.length - 2;
if (i < 0)
return;

while (i > 0) {
if (num[i] < num[i+1]) {
break;
}
i--;
}

int pivot = num[i];
int j = num.length - 1;
while (num[j] <= pivot && i != j)
j--;
if (i == 0 && j == 0) {
reverseArray(0, num.length - 1, num);
return;
}
int temp = num[j];
num[j] = num[i];
num[i] = temp;
reverseArray(i + 1, num.length - 1, num);
}
private void reverseArray(int start, int end, int[] a){
int mid = (end + start)/2;
if(start+1==end){
int t= a[start];
a[start]=a[end];
a[end] =t;
}else
for(int k=start; k<=mid; k++)
{
int temp = a[k];
a[k] = a[end-k+start];
a[end-k+start] = temp;
}
}
}

----------------------------

Hint: 1.要知道原理

2.不知道reverse 数组，有没有什么快捷的方法。。。。。不知道交换数组中2个元素，有没有快捷的方法。我用的都是很基本的方法。

改了一下，意思一样，代码简洁了一些：

public class Solution {
    public void nextPermutation(int[] num) {
		int pivot = 0;
		for (int i = num.length - 2; i >= 0; i--) {
			if (num[i] < num[i + 1]) {
				pivot = i;
				break;
			}
		}

		int j = num.length - 1;
		while (j != pivot && num[j] <= num[pivot])
			j--;

		if (j <= 0) {
			reverseStringArray(num, 0, num.length - 1);
		} else {
			int c = num[pivot];
			num[pivot] = num[j];
			num[j] = c;
			reverseStringArray(num, pivot + 1, num.length - 1);
		}
	}

	private static void reverseStringArray(int[] s, int start, int end) {
		for (int i = start; i < (start + end+1) / 2; i++) {
			int c = s[i];
			s[i] = s[end  - (i - start)];
			s[end  - (i - start)] = c;
		}
	}
}