-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1752.cpp
More file actions
74 lines (59 loc) · 1.79 KB
/
1752.cpp
File metadata and controls
74 lines (59 loc) · 1.79 KB
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
71
72
#include<iostream>
#include<vector>
#include<algorithm>
bool check(std::vector<int>& nums) {
std::vector<int> vec;
auto sml_ele = std::min_element(nums.begin(), nums.end());
auto first_oc = std::find(nums.begin(), nums.end(), *sml_ele);
auto second_oc = std::find(first_oc + 1, nums.end(), *sml_ele);
auto last_oc = std::find(nums.rbegin(), nums.rend(), *sml_ele);
int index = -1;
int index2 = -1;
int index3 = -1;
if(sml_ele != nums.end()) {
index = std::distance(nums.begin(), sml_ele);
index2 = std::distance(nums.begin(), second_oc);
if(last_oc != nums.rend()) {
index3 = std::distance(nums.begin(), last_oc.base()) - 1;
}
}
else {
return false;
}
bool all_same = std::all_of(nums.begin() + index, nums.begin() + index3 + 1,
[&](int x) { return x == *sml_ele; });
if(index2 == index3 && !all_same) {
for(int i = index3; i < nums.size(); ++i) {
vec.push_back(nums[i]);
}
for(int i = 0; i < index3; ++i) {
vec.push_back(nums[i]);
}
}
else if(index2 != index3 && index2 != index) {
for(int i = index2; i < nums.size(); ++i) {
vec.push_back(nums[i]);
}
for(int i = 0; i < index2; ++i) {
vec.push_back(nums[i]);
}
}
else {
for(int i = index; i < nums.size(); ++i) {
vec.push_back(nums[i]);
}
for(int i = 0; i < index; ++i) {
vec.push_back(nums[i]);
}
}
if(is_sorted(vec.begin(), vec.end())) {
return true;
}
return false;
}
int main() {
/*std::vector<int> vec { 3, 4, 1, 2 };*/
std::vector<int> vec { 3, 4, 1, 2 };
std::cout << check(vec);
std::cin.get();
}