Leetcode Find Minimum in Rotated Sorted Array

来源:互联网 发布:mac怎么下载全名k歌 编辑:程序博客网 时间:2024/05/18 02:54

题意:找有序队列经过旋转后得到的队列中的最小值。

思路:二分查找。

class Solution {public:    int findMin(vector<int>& nums) {        unsigned midp = 0;        unsigned lowb = 0;        unsigned uperb = nums.size() - 1;        midp = (lowb + uperb) / 2;        while(nums[lowb] > nums[uperb]) {            if(nums[midp] < nums[lowb]) {                uperb = midp;                midp = (uperb + lowb) / 2;            }            else {                lowb = midp + 1;                midp = (lowb + uperb) / 2;            }        }        return nums[lowb];    }};


0 0
原创粉丝点击