LEETCODE: Find Minimum in Rotated Sorted Array II

最新推荐文章于 2024-10-01 04:50:10 发布

停止更新+1

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量280

点赞数

文章标签： LEETCODE 算法

本文链接：https://blog.csdn.net/anyicheng2015/article/details/43022187

版权

LEETCODE 专栏收录该内容

153 篇文章 0 订阅

订阅专栏

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 minimum;
    void findMin(vector<int> &num, int left, int right) {
        if(left > right) return;
        int mid = (left + right) / 2;
        if(num[left] < num[mid]) {
            minimum = min(minimum, num[left]);
            findMin(num, mid + 1, right);
            return;
        }
        
        if(num[mid] < num[right]) {
            minimum = min(minimum, num[mid]);
            findMin(num, left, mid - 1);
            return;
        }
        
        minimum = min(minimum, num[left]);
        findMin(num, left, mid - 1);
        findMin(num, mid + 1, right);
    }

    int findMin(vector<int> &num) {
        if(num.size() == 0) return 0;
        
        minimum = 0x7fffffff;
        findMin(num, 0, num.size() - 1);
        return minimum;
    }
};