(self, nums, target, lo, hi)
| 66 | return lo |
| 67 | |
| 68 | def bi_search(self, nums, target, lo, hi): |
| 69 | while lo < hi: |
| 70 | mid = (lo + hi) // 2 |
| 71 | if nums[mid] == target: |
| 72 | return mid |
| 73 | |
| 74 | if nums[mid] > target: |
| 75 | hi = mid |
| 76 | else: |
| 77 | lo = mid + 1 |
| 78 | |
| 79 | return -1 |
| 80 | |
| 81 | |
| 82 | def search(self, nums, target): |