[969. Pancake Sorting 翻转排序][1]

class Solution {
public:
    vector<int> pancakeSort(vector<int>& A) {
        vector<int> res;
        for(int i=0;i<A.size()-1;i++) {
            auto maxPos = max_element(A.begin(), A.end()-i);
            res.push_back(maxPos-A.begin()+1);
            res.push_back(A.size()-i);
            reverse(A.begin(), maxPos+1);
            reverse(A.begin(), A.end()-i);
        }
        
        return res;
    }
};