剑指Offer 11

 1 # -*- coding:utf-8 -*-
 2 class Solution:
 3     def minNumber(self,rotateArray,l,h):
 4         for i in range(l,h):
 5             if rotateArray[i] > rotateArray[i+1]:
 6                 return rotateArray[i+1]
 7         return rotateArray[l]
 8             
 9     def minNumberInRotateArray(self, rotateArray):
10         n = len(rotateArray)
11         if n == 0:
12             return 0
13         l,h = 0,n-1
14         while l<h:
15             m = l + (h-l)//2
16             if rotateArray[m] == rotateArray[l] and rotateArray[m] == rotateArray[h]:
17                 return self.minNumber(rotateArray,l,h)
18             elif rotateArray[m] < rotateArray[h]:
19                 h = m
20             else:
21                 l = m+1
22         return rotateArray[l]
23         # write code here