Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Find Minimum in Rotated Sorted Array的扩展题,这题中有重复元素的出现,思路跟Search in Rotated Sorted ArrayII 差不多,如果中间元素和边缘元素相等,把边缘元素移动一步~如果num[mid] > num[right],则说明左半边有序,所以left = mid + 1; 如果num[mid] < num[right],则说明右半边有序,因为中间元素有可能是最小的,所以right = mid而非right= mid - 1; 如果中间元素与右边缘元素相等,把right向左移一位~ (这里没有比较中间元素与左边缘元素是因为中间元素大于左边缘元素时,还有一种可能是这个有序数组没有rotate,所以最小的元素是第一个元素)~最坏情况是每次都要移动一步,总共移动n步,算法的时间复杂度就变成了O(n)。
class Solution:
# @param num, a list of integer
# @return an integer
def findMin(self, num):
if num is None or len(num) == 0:
return 0
left, right = 0, len(num) - 1
while left <= right:
mid = left + (right - left) / 2
if num[mid] > num[right]:
left = mid + 1
elif num[mid] < num[right]:
right = mid
else:
right -= 1
return num[left]