(self, nums, target, lo, hi)
| 78 | return lo |
| 79 | |
| 80 | def bi_search(self, nums, target, lo, hi): |
| 81 | while lo < hi: |
| 82 | mid = (lo + hi) // 2 |
| 83 | if nums[mid] == target: |
| 84 | return mid |
| 85 | |
| 86 | if nums[mid] > target: |
| 87 | hi = mid |
| 88 | else: |
| 89 | lo = mid + 1 |
| 90 | |
| 91 | return -1 |
| 92 | |
| 93 | |
| 94 | def search(self, nums, target): |