[leetcode 154] Find Minimum in Rotated Sorted Array II

最新推荐文章于 2025-09-11 19:19:55 发布

「已注销」

最新推荐文章于 2025-09-11 19:19:55 发布

阅读量229

点赞数

CC 4.0 BY-SA版权

分类专栏： [LeetCode 刷题] 文章标签： leetcode Binary Search

本文链接：https://blog.youkuaiyun.com/xinxinxv/article/details/42648669

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

探讨了在一个可能包含重复元素的旋转排序数组中寻找最小元素的问题。文章提供了一个C++实现示例，通过二分查找的方式高效地解决了这一挑战。

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

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.

The array may contain duplicates.

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