【CODE】Pancake Sorting

vector 煎饼排序，find函数

969. Pancake Sorting

Medium

209256FavoriteShare

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. 1 <= A.length <= 100
2. A[i] is a permutation of [1, 2, ..., A.length]

class Solution {
public:
    vector<int> pancakeSort(vector<int>& A) {
        vector<int> tmp=A;
        vector<int> res;
        sort(tmp.begin(),tmp.end());
        for(int i=A.size()-1;i>=0;i--){
            vector<int> ::iterator maxx=find(A.begin(),A.begin()+i,tmp[i]);
            if(maxx-A.begin()<i){
                if(maxx-A.begin()!=0){
                    reverse(A.begin(),A.begin()+(maxx-A.begin()+1));
                    res.push_back(maxx-A.begin()+1);
                }
                if(A==tmp) return res;
                reverse(A.begin(),A.begin()+i+1);
                res.push_back(i+1);
            }else if(maxx-A.begin()>i){
                reverse(A.begin(),A.begin()+i+1);
                res.push_back(i+1);
                if(A==tmp) return res;
            }
        }
        return res;
    }
};

• Runtime: 68 ms, faster than 6.78% of C++ online submissions for Pancake Sorting.
• Memory Usage: 8.9 MB, less than 50.00% of C++ online submissions for Pancake Sorting.
• Next challenges:
• Find First and Last Position of Element in Sorted Array ——【CODE】
• Insert Interval —— 【CODE】
• Best Time to Buy and Sell Stock with Transaction Fee —— 【CODE】
• 煎饼排序：寻找1~i中最大的元素，假设为第m。反转1~m，使得最大的元素到队头。反转1~i,使得最大的元素到队尾。重复上述步骤n次，并且i从n开始取到1。此时，就会使第n大、第n-1大到最后第一个元素经过两次反转换到相应的位置上。
• 在vector中使用find：vector<int> ::iterator maxx=find(A.begin(),A.begin()+i,tmp[i]);
• 找到的元素坐标：maxx-A.begin()
• 相同思路：

class Solution {
public:
    vector<int> pancakeSort(vector<int>& A) {
        vector<int> res;
        for(int i=A.size()-1;i>=0;i--){
            int maxx=A[i],dis=i;
            for(int j=0;j<=i;j++){
                if(maxx<A[j]){
                    maxx=A[j];dis=j;
                }
            }
            reverse(A.begin(),A.begin()+dis+1);
            res.push_back(dis+1);
            reverse(A.begin(),A.begin()+i+1);
            res.push_back(i+1);
        }
        return res;
    }
};

• Runtime: 8 ms, faster than 62.45% of C++ online submissions for Pancake Sorting.
• Memory Usage: 8.7 MB, less than 100.00% of C++ online submissions for Pancake Sorting.