(self, nums)
| 32 | """ |
| 33 | class Solution(object): |
| 34 | def find_rotate(self, nums): |
| 35 | target = nums[0] |
| 36 | |
| 37 | lo = 1 |
| 38 | |
| 39 | for i in range(1, len(nums)): |
| 40 | if nums[i] == target: |
| 41 | lo += 1 |
| 42 | else: |
| 43 | break |
| 44 | |
| 45 | hi = len(nums) |
| 46 | |
| 47 | while lo < hi: |
| 48 | mid = (lo + hi) // 2 |
| 49 | if nums[mid] > target: |
| 50 | lo = mid + 1 |
| 51 | else: |
| 52 | hi = mid |
| 53 | |
| 54 | return lo |
| 55 | |
| 56 | def findMin(self, nums): |
| 57 | """ |