07--查找最小值（二分法）

查找最小值（可以采用二分法）

# -*- coding: utf-8 -*-
class Solution:
	def minNumberInRotateArray(self, rotateArray):
		"""
		# O(n)的复杂度
		minNum = 0
		for i in range(len(rotateArray)):
			minNum = minNum if minNum < rotateArray[i]  and minNum != 0 else rotateArray[i]
		return minNum
		"""
		#  二分查找法
		#  有序的数组中，就用哪个二分查找法
	def bSearch(self, array, target):
		left = 0
		right = len(array) - 1

		while left <= right:
			# 101 = 5 => 10 = 2
			# 1100 = 12 => 110 = 6
			# mid = (left+right) >> 1
			mid = (left + right) // 2
			if array[mid] == target:
				return mid
			elif array[mid] < target:
				left = mid + 1
			else:
				right = mid -1
		return None

if __name__ == "__main__":
	s = Solution()
	str = [1, 2, 3, 4, 5]
	print(s.bSearch(str, 5))
	print(s.minNumberInRotateArray(str))