Leetcode 153 Find Minimum in Rotated Sorted Array

triplebee

发布于 2018-01-12 14:51:13

4980

发布于 2018-01-12 14:51:13

文章被收录于专栏：计算机视觉与深度学习基础计算机视觉与深度学习基础计算机视觉与深度学习基础

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(nums[l]>nums[r])
        {
            int mid = (l + r) >> 1;
            if(nums[mid] >= nums[l]) 
                l = mid+1;
            else  
                r = mid; 
        }
        return nums[l];
    }
};

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2016-12-29 ，如有侵权请联系 cloudcommunity@tencent.com 删除

element