(self, nums, target)
| 45 | |
| 46 | class Solution(object): |
| 47 | def find_bi(self, nums, target): |
| 48 | lo = 0 |
| 49 | hi = len(nums) |
| 50 | |
| 51 | while lo < hi: |
| 52 | mid = (lo + hi) // 2 |
| 53 | |
| 54 | if nums[mid] == target: |
| 55 | return mid |
| 56 | |
| 57 | if nums[mid] < target: |
| 58 | lo = mid + 1 |
| 59 | else: |
| 60 | hi = mid |
| 61 | |
| 62 | def maxSlidingWindow(self, nums, k): |
| 63 | """ |