版权声明：本文为博主原创文章，未经博主允许不得转载。@ceezyyy11 https://blog.csdn.net/ceezyyy11/article/details/88835955
[LeetCode] 153. Find Minimum in Rotated Sorted Array (C++)
Medium
Share
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
Find the minimum element.
You may assume no duplicate exists in the array.
Example 1:
Input: [3,4,5,1,2]
Output: 1
Example 2:
Input: [4,5,6,7,0,1,2]
Output: 0
class Solution {
public:
int findMin(vector<int>& nums) {
sort(nums.begin(),nums.end(),less<int>());
return nums.at(0);
}
};
/*
Submission Detail:
Runtime: 4 ms, faster than 100.00% of C++ online submissions for Find Minimum in Rotated Sorted Array.
Memory Usage: 8.7 MB, less than 63.67% of C++ online submissions for Find Minimum in Rotated Sorted Array.
*/
/*
Study Notes:
How to realize that "suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand"?
*/