1
class Solution {
2
    public int[] searchRange(int[] nums, int target) {
3
        int left = -1;
4
        int right = -1;
5
        int start = 0;
6
        int end = nums.length - 1;
7
        //寻找第一个出现
8
        while(start <= end){//因为闭区间 等于时也符合
9
            int mid = (start + end)/2;
10
            if(nums[mid] == target){
11
                left = mid;
12
                end = mid - 1;//继续向左寻找
13
            }
14
            else if(nums[mid] > target){
15
                end = mid - 1;
16
            }
17
            else start = mid + 1;
18
        }
19
        start = 0;
20
        end = nums.length - 1;
21
        //寻找最后一个
22
        while(start <= end){//因为闭区间 等于时也符合
23
            int mid = (start + end)/2;
24
            if(nums[mid] == target){
25
                right = mid;
26
                start = mid + 1;//继续向右寻找
27
            }
28
            else if(nums[mid] > target){
29
                end = mid - 1;
30
            }
31
            else start = mid + 1;
32
        }
33
        if(left == -1 || right == -1){
34
            int[] res={-1,-1};
35
            return res;
36
        }
37
        int[] res={left,right};
38
        return res;
39
    }
40
}//感谢大佬题解 时间复杂度O(log n)