leetcode 34. Search for a Range

最新推荐文章于 2020-09-25 08:06:05 发布

moli2333

最新推荐文章于 2020-09-25 08:06:05 发布

阅读量137

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/wl0627/article/details/52510893

版权

leetcode 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm’s runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

二分查找一般是指有序数组中没有重复元素的情况很好理解等于就是找到了不等于就移
v[mid] > target 移j: j = mid
v[mid] < target 移i: i = mid
这个题和普通的二分搜索的区别在于数组中可能有重复元素
那么假设是要找重复元素中的第一个值：
v[mid] > target 移j: j = mid 移法不变
v[mid] < target 移i: i = mid 移法不变
v[mid] == target时显然是不能返回了应该是j = mid
直到ij汇合
同理如果是找最后一个值
v[mid] == target时让 i = mid

public int[] searchRange(int[] nums, int target) {
        int[] result = new int[2];
        result[0] = findBeginOrEnd(nums, target, true);
        result[1] = findBeginOrEnd(nums, target, false);
        return result;
    }
    public int findBeginOrEnd(int[] nums, int target,boolean findBegin){
        int i = 0;
        int j = nums.length - 1;
        int mid = (i+j) / 2;
        while(i < j){
            if(findBegin == true){mid = (i + j) / 2;}
            else{mid = (i + j + 1) / 2;}
            if(nums[mid] > target){
                j = mid - 1;
            }
            else if(nums[mid] < target){
                i = mid + 1;
            }
            else{
                if(findBegin == true){j = mid;}
                else{i = mid;}
            }
        }
        if(i == j && nums[i] == target) return i;
        else return -1;
    }