"微信公众号"
题目链接:
题目:
解题思路:
(1)最笨的一种方法:遍历整个数组,找出其中最小的数。这样肯定拿不到offer。
# -*- coding:utf-8 -*-
class Solution:
def minNumberInRotateArray(self, rotateArray):
minNum = rotateArray[0]
for i, temp in enumerate(rotateArray):
if(minNum >= temp):
minNum = temp
return minNum
if __name__=="__main__":
solution = Solution()
array = [3,4,5,1,2]
print(solution.minNumberInRotateArray(array))
(2)在第一种方法的基础上,稍微改进一点。
# -*- coding:utf-8 -*-
class Solution:
def minNumberInRotateArray(self, rotateArray):
for i, temp in enumerate(rotateArray):
if(temp > rotateArray[i+1]):
return rotateArray[i+1]
if __name__=="__main__":
solution = Solution()
array = [3,4,5,1,2]
print(solution.minNumberInRotateArray(array))
(3)二分查找法。
mid = (low + high ) / 2
需要考虑三种情况:
1)array[mid] > array[high]:
出现这种情况的array类似[3,4,5,6,0,1,2],此时最小数字一定在mid的右边。
low = mid + 1
2)array[mid] < array[high]:
出现这种情况的array类似[2,2,3,4,5,6,6],此时最小数字是array[mid]或者在mid的左边。因为mid右边必然都是递增的。
high = mid (思考:这里为什么不是high = mid -1 呢?)
解答:这里有个坑,如果待查询的范围最后只剩两个数,那么mid 一定会指向下标靠前的数字
比如 array = [4,6]
array[low] = 4 ;array[mid] = 4 ; array[high] = 6 ;
如果high = mid - 1,就会产生错误, 因此high = mid。但情形1)中low = mid + 1就不会错误。
3)array[mid] == array[high]:
出现这种情况的array类似 [1,0,1,1,1] 或者[1,1,1,0,1],此时最小数字不好判断在mid左边还是右边,这时只好一个一个试 ,
high = high - 1。
# -*- coding:utf-8 -*-
class Solution:
def minNumberInRotateArray(self, rotateArray):
if (len(rotateArray) == 0):
return 0
low = 0
high = len(rotateArray) - 1
while low < high :
mid = (low + high) / 2
if rotateArray[mid] > rotateArray[high]:
low = mid + 1
elif rotateArray[mid] < rotateArray[high]:
high = mid
else:
high = high - 1
return rotateArray[low]
if __name__=="__main__":
solution = Solution()
array = [3,4,5,1,2]
print(solution.minNumberInRotateArray(array))
类似文章:
【2】算法-在有序数组、无序数组中进行折半查找和二分法找无序数组中第k小(大)的数
Reference:
【1】链接:https://www.nowcoder.com/questionTerminal/9f3231a991af4f55b95579b44b7a01ba 来源:牛客网
【2】链接:https://www.nowcoder.com/questionTerminal/9f3231a991af4f55b95579b44b7a01ba 来源:牛客网