Find Minimum in Rotated Sorted Array

最新推荐文章于 2022-07-27 13:01:15 发布

原创最新推荐文章于 2022-07-27 13:01:15 发布 · 564 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种使用二分查找法解决寻找旋转排序数组中最小元素的问题的方法。通过递归的方式，算法能够有效地找到经过旋转后的排序数组中的最小值。

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.

解题思路:典型的二分查找法.

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int FindMinIN(vector<int> &num,int first,int last)
{
	if (num[first] <= num[last])
		return num[first];
	int mid = (first + last) / 2;
	if (num[mid] >= num[first])
		return min(num[first], FindMinIN(num, mid + 1, last));
	else
		return min(num[mid], FindMinIN(num, first, mid-1));
}
int findMin(vector<int> &num) {

	return FindMinIN(num, 0, num.size() - 1);
}