LeetCode-Pancake Sorting

Description：
Given an array A, we can perform a pancake flip: We choose some positive integer k <= A.length, then reverse the order of the first k elements of A. We want to perform zero or more pancake flips (doing them one after another in succession) to sort the array A.

Return the k-values corresponding to a sequence of pancake flips that sort A. Any valid answer that sorts the array within 10 * A.length flips will be judged as correct.

Example 1:

Input: [3,2,4,1]
Output: [4,2,4,3]
Explanation: 
We perform 4 pancake flips, with k values 4, 2, 4, and 3.
Starting state: A = [3, 2, 4, 1]
After 1st flip (k=4): A = [1, 4, 2, 3]
After 2nd flip (k=2): A = [4, 1, 2, 3]
After 3rd flip (k=4): A = [3, 2, 1, 4]
After 4th flip (k=3): A = [1, 2, 3, 4], which is sorted. 

Example 2:

Input: [1,2,3]
Output: []
Explanation: The input is already sorted, so there is no need to flip anything.
Note that other answers, such as [3, 3], would also be accepted.

Note:

• 1 <= A.length <= 100
• A[i] is a permutation of [1, 2, …, A.length]

题意：对一个数组A进行多次的翻转k（0 < k <= A.length）操作，即
每次翻转前k个元素，直到数组A变为有序状态；

解法：我们从数组A的最大值开始，将其翻转到第一个位置后，再次翻转到最后一个位置，这样这个最大值就已经处于有序后的正确位置处；对次最大值也重复此操作；下面是具体的流程

1. 遍历数组A，找到未有序元素中的最大值num
2. 将num翻转到第一个位置处
3. 将num翻转到未有序序列的最后一个位置处，即有序后的位置

Java

class Solution {
    public List<Integer> pancakeSort(int[] A) {
        List<Integer> res = new ArrayList<>();
        for (int num = A.length; num > 0; num--) {
            int pos = 0;
            while (A[pos] != num) {
                pos++;
            }
            reverse(A, pos + 1);
            res.add(pos + 1);
            reverse(A, num);
            res.add(num);
        }
        
        return res;
    }
    
    private void reverse(int[] A, int k) {
        for (int i = 0, j = k - 1; i < j; i++, j--) {
            A[i] = A[i] ^ A[j];
            A[j] = A[i] ^ A[j];
            A[i] = A[i] ^ A[j];
        }
    }
}