LeetCode：Find Minimum in Rotated Sorted Array

最新推荐文章于 2015-03-31 10:46:50 发布

hackerzchao

最新推荐文章于 2015-03-31 10:46:50 发布

阅读量647

点赞数

分类专栏： LeetCode LeetCode 文章标签： leetcode 二分查找

本文链接：https://blog.csdn.net/hnuzengchao/article/details/42082915

版权

LeetCode 同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

LeetCode

48 篇文章 4 订阅

订阅专栏

该博客讨论了如何在已知排序数组被未知位置旋转后的数组中找到最小元素，重点介绍了利用二分查找算法来解决LeetCode上的相关问题。

摘要由CSDN通过智能技术生成

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.

// Source : https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
// Author : Chao Zeng
// Date   : 2014-12-22
class Solution {
public:
    int findMin(vector<int> &num) {
        int left = 0, right = num.size() - 1;
        int middle = 0;
        while (left < right){
            //已排序数组不一定是升序...
            if (right - left == 1){
                if (num[left] > num[right])
                    middle = right;
                else
                    middle = left;
                break;
            }
            middle = (left + right) >> 1;
            //数组可能并未旋转
            if (num[middle] > num[left] && num[middle] < num[right])
                return num[left];
            if (num[middle] < num[left] && num[middle] > num[right])
                return num[right];

            if (num[middle] >= num[left]){
                left = middle;
            }
            else if (num[middle] <= num[right]){
                right = middle;
            }
        }
        return num[middle];
    }
};