@@ -19,7 +19,8 @@ const search = function (nums, target) {
1919 * @param target
2020 */
2121function binarySearch ( nums , target ) {
22- let left = 0 ; let right = nums . length
22+ let left = 0
23+ let right = nums . length
2324 while ( left < right ) {
2425 // 注意js取整问题;
2526 const mid = left + Number . parseInt ( ( right - left ) / 2 )
@@ -45,7 +46,8 @@ function binarySearch(nums, target) {
4546 * @param target
4647 */
4748function leftBound ( nums , target ) {
48- let left = 0 ; let right = nums . length - 1
49+ let left = 0
50+ let right = nums . length - 1
4951
5052 // [left,right]
5153 while ( left <= right ) {
@@ -74,7 +76,9 @@ function leftBound(nums, target) {
7476 * @param target
7577 */
7678function rightBound ( nums , target ) {
77- let left = 0 ; let right = nums . length
79+ let left = 0
80+ let right = nums . length
81+
7882 // [left,right) 情况
7983 while ( left < right ) {
8084 const mid = left + Math . floor ( ( right - left ) / 2 )
@@ -97,9 +101,8 @@ function rightBound(nums, target) {
97101 return nums [ left - 1 ] === target ? left - 1 : - 1
98102}
99103
100- // console.log(search([-1,0,3,5,9,12],9))
101-
102- // console.log(search([5,7,7,8,8,8,10],8))
103-
104- // console.log(left_bound([5,7,7,8,8,8,10],8))
105- console . log ( rightBound ( [ 5 , 7 , 7 , 8 , 8 , 8 , 10 ] , 8 ) )
104+ const nums = [ 5 , 7 , 7 , 8 , 8 , 8 , 10 ]
105+ const target = 8
106+ console . log ( search ( nums , target ) )
107+ console . log ( leftBound ( nums , target ) )
108+ console . log ( rightBound ( nums , target ) )
0 commit comments