(*leetcode_Array)Find Minimum in Rotated Sorted Array

准备找工作的Ocean

于 2015-04-01 20:28:24 发布

阅读量453

点赞数

CC 4.0 BY-SA版权

分类专栏：刷题找工作

本文链接：https://blog.youkuaiyun.com/zxasqwedc/article/details/44812567

刷题找工作专栏收录该内容

133 篇文章

订阅专栏

本文介绍如何在已知旋转排序数组中找到最小元素，采用二分查找法，通过比较数组末尾元素与中间元素，不断缩小搜索范围直至找到最小值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Find Minimum in Rotated Sorted Array

Total Accepted: 35966 Total Submissions: 109229 My Submissions

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.

Show Tags

Have you met this question in a real interview?

Yes

Discuss

二分查找，不过要比较的是num[len-1]这个元素，找到比num[len-1]小的元素一直缩进即可

class Solution {
public:
    int findMin(vector<int> &num) {
        
        int len = num.size();
        if(len==0)  return 0;
        int left = 0, right = len-1;
        while(left<right){
            int mid = (left+right)/2;
            if(num[mid]>num[len-1])
                left = mid+1;
            else
                right = mid;     
        }
        return num[left];
    }
};