leetcode

0 class Solution {

1 public:

2 vector<int> pancakeSort(vector<int> &arr) {

3 vector<int> res;

4

5 for (int i = arr.size() - 1, low, high; i >= 0; i--) {

6 if (arr[i] == i + 1) continue;

7

8 low = 0, high = 0;

9 while (arr[high] != i + 1)

10 high++;

11

12 res.push_back(high + 1);

13 while (low < high)

14 swap(arr[low++], arr[high--]);

15

16 low = 0, high = i;

17 res.push_back(high + 1);

18 while (low < high)

19 swap(arr[low++], arr[high--]);

20 }

21 return res;

22 }

23 };