-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q154.cpp
45 lines (40 loc) · 1.07 KB
/
Q154.cpp
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
#include<vector>
#include<limits>
#include<algorithm>
using namespace std;
class Solution {
public:
int findMin(vector<int>& nums) {
int res = INT_MAX;
for (auto i : nums) res = min(res, i);
return res;
}
int findMin2(vector<int> &nums){
if (nums.size() == 1) return nums[0];
if (nums.size() == 2) return min(nums[0], nums[1]);
decltype(nums.size()) left = 0;
decltype(nums.size()) right = nums.size() - 1;
decltype(nums.size()) mid = (left + right) / 2;
while (right - left >= 2){
while (right - left >= 2 && nums[left] == nums[right]) right--;
if (right - left < 2) break;
mid = (left + right) / 2;
if (nums[mid - 1] > nums[mid] && nums[mid + 1] > nums[mid]) return nums[mid];
if (nums[mid] >= nums[left] && nums[left] >= nums[right]){
left = mid;
mid = (left + right) / 2;
}
else{
right = mid;
mid = (left + right) / 2;
}
}
return min(nums[left], nums[right]);
}
};
int main(void){
vector<int> nums = { 3, 3, 3, 1 };
Solution mode;
int res = mode.findMin2(nums);
return 0;
}