(self, nums)
| 62 | """ |
| 63 | class Solution(object): |
| 64 | def find_rotate(self, nums): |
| 65 | target = nums[0] |
| 66 | |
| 67 | lo = 1 |
| 68 | |
| 69 | hi = len(nums) |
| 70 | |
| 71 | while lo < hi: |
| 72 | mid = (lo + hi) // 2 |
| 73 | if nums[mid] > target: |
| 74 | lo = mid + 1 |
| 75 | else: |
| 76 | hi = mid |
| 77 | |
| 78 | return lo |
| 79 | |
| 80 | def bi_search(self, nums, target, lo, hi): |
| 81 | while lo < hi: |