forked from Reaper622/DataStructure-Algorithm-TS
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSearchRange.js
More file actions
37 lines (37 loc) · 1.05 KB
/
SearchRange.js
File metadata and controls
37 lines (37 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
"use strict";
exports.__esModule = true;
/**
* 在排序数组中查找元素的第一个和最后一个位置 返回一个数组[FirstIndex, LastIndex]
* 若不存在该值，则返回[-1, -1]
*
* @param {number[]} nums
* @param {number} target
*/
function SearchRange(nums, target) {
var left = 0;
var right = nums.length - 1;
while (left < right) {
var mid = Math.floor(left + (right - left) / 2);
// 如果找到了该值 则继续查找范围
if (nums[mid] === target) {
var midLeft = mid;
var midRight = mid;
while (nums[midLeft - 1] === target) {
midLeft--;
}
while (nums[midRight + 1] === target) {
midRight++;
}
return [midLeft, midRight];
}
else if (nums[mid] > target) {
right = mid;
}
else {
left = mid + 1;
}
}
// 判断是否存在该值
return nums[left] === target ? [left, left] : [-1, -1];
}
exports.SearchRange = SearchRange;