|
4 | 4 | * @return {number[]} |
5 | 5 | */ |
6 | 6 | var searchRange = function (nums, target) { |
7 | | - letfirstMatch = binarySearch(nums,0,nums.length-1, target); |
| 7 | + constout = [-1, -1]; |
8 | 8 |
|
9 | | - if (firstMatch === -1) return [-1, -1]; |
| 9 | + out[0] = getFirst(nums, target); |
| 10 | + out[1] = getLast(nums, target); |
10 | 11 |
|
11 | | - let i = firstMatch, |
12 | | - j = firstMatch; |
13 | | - while (i > -1 && nums[i - 1] === target) { |
14 | | - i--; |
15 | | - } |
16 | | - while (j < nums.length - 1 && nums[j + 1] === target) { |
17 | | - j++; |
18 | | - } |
19 | | - |
20 | | - return [i, j]; |
| 12 | + return out; |
21 | 13 | }; |
22 | 14 |
|
23 | | -const binarySearch = function (nums, left, right, target) { |
24 | | - while (left <= right) { |
25 | | - const mid = Math.floor((left + right) / 2); |
26 | | - if (nums[mid] === target) { |
| 15 | +var getFirst = function (nums, target) { |
| 16 | + var lo = 0, |
| 17 | + hi = nums.length - 1; |
| 18 | + while (lo <= hi) { |
| 19 | + let mid = Math.floor((lo + hi) / 2); |
| 20 | + |
| 21 | + if (target === nums[mid] && (mid === 0 || nums[mid - 1] < target)) { |
27 | 22 | return mid; |
| 23 | + } else if (target > nums[mid]) { |
| 24 | + lo = mid + 1; |
| 25 | + } else { |
| 26 | + hi = mid - 1; |
28 | 27 | } |
| 28 | + } |
29 | 29 |
|
30 | | - if (nums[mid] < target) { |
31 | | - left = mid + 1; |
| 30 | + return -1; |
| 31 | +}; |
| 32 | + |
| 33 | +var getLast = function (nums, target) { |
| 34 | + var lo = 0, |
| 35 | + hi = nums.length - 1; |
| 36 | + while (lo <= hi) { |
| 37 | + let mid = Math.floor((lo + hi) / 2); |
| 38 | + |
| 39 | + if ( |
| 40 | + target === nums[mid] && |
| 41 | + (mid === nums.length - 1 || nums[mid + 1] > target) |
| 42 | + ) { |
| 43 | + return mid; |
| 44 | + } else if (target < nums[mid]) { |
| 45 | + hi = mid - 1; |
32 | 46 | } else { |
33 | | - right = mid - 1; |
| 47 | + lo = mid + 1; |
34 | 48 | } |
35 | 49 | } |
36 | 50 |
|
|
0 commit comments