-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0969.hpp
70 lines (61 loc) · 1.65 KB
/
q0969.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
//
// q0969.hpp
// LeetCode
//
// Created by NowOrNever on 29/08/2020.
// Copyright © 2020 DoubleL. All rights reserved.
//
#ifndef q0969_hpp
#define q0969_hpp
#include <iostream>
#include <queue>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <numeric>
#include <stack>
#include <string>
using namespace std;
void printIntVector(vector<int> &array){
for (int i = 0; i < array.size(); i++) {
cout << array[i] << " ";
}
cout << endl;
}
void question0969(){
class Solution {
public:
vector<int> pancakeSort(vector<int>& A) {
int target = (int)A.size();
vector<int> result;
while (target > 0) {
for (int i = 0; i < target - 1; i++) {
if (target == A[i]) {
if (i == 0){
result.push_back(target);
reverse(A.begin(), A.begin() + target);
}else{
result.push_back(i + 1);
reverse(A.begin(), A.begin() + i + 1);
result.push_back(target);
reverse(A.begin(), A.begin() + target);
}
break;
}
}
target--;
}
return result;
}
};
vector<int> A = {3,2,4,1};
vector<int> result = Solution().pancakeSort(A);
for (int i = 0; i < result.size(); i++) {
cout << result[i] << " ";
}
cout << endl;
}
void question0969();
#endif /* q0969_hpp */