Leetcode 153. Find Minimum in Rotated Sorted Array (Medium) (cpp)

来源:互联网 发布:十大排序算法复杂度 编辑:程序博客网 时间:2024/05/18 02:10

Leetcode 153. Find Minimum in Rotated Sorted Array (Medium) (cpp)

Tag: Array, Binary Search

Difficulty: Medium


/*153. Find Minimum in Rotated Sorted Array (Medium)Suppose a sorted array 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.*/class Solution {public:int findMin(vector<int>& nums) {int l = 0, r = nums.size() - 1;while (l < r) {int mid = l + (r - l) / 2;if (nums[mid] < nums[r]) {                r = mid;            } else {                l = mid + 1;            }        }        return nums[l];    }};


0 0
原创粉丝点击