LeetCode Find Minimum in Rotated Sorted Array

最新推荐文章于 2024-11-13 08:49:23 发布

wdkirchhoff

最新推荐文章于 2024-11-13 08:49:23 发布

阅读量794

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 算法文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/wdkirchhoff/article/details/45065231

LeetCode 同时被 2 个专栏收录

46 篇文章

订阅专栏

算法

38 篇文章

订阅专栏

本文介绍了解决在已排序数组中进行旋转后寻找最小元素的问题，通过二分查找算法实现高效的解决方案。

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

Find Minimum in Rotated Sorted Array Total Accepted: 38126 Total Submissions: 115306 My Submissions Question Solution
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> &num) {
        int size = num.size() - 1;
        int l = 0;
        int r = size;
        while(l <= r) {
            int mid = l + (r - l) / 2;
            if (num[mid] > num[size]) {
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        return num[l];
    }
};