Search for a Range

原创 2015年11月17日 16:46:47

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].

public class Solution {
    public int findLeft(int[] nums, int target) {
        int low = 0;
        int high = nums.length - 1;
        while(low <= high) {
            int mid = (low + high) / 2;
            if(nums[mid] < target)
                low = mid + 1;
            else
                high = mid - 1;
        }
        /* need to check the low's index, low will be less than the 0 */
        if(low >= 0 && low < nums.length && nums[low] == target)
            return low;
        else
            return -1;
    }

    public int findRight(int[] nums, int target) {
        int low = 0;
        int high = nums.length - 1;
        while(low <= high) {
            int mid = (low + high) / 2;
            if(nums[mid] <= target)
                low = mid + 1;
            else
                high = mid - 1;
        }
        if(high >= 0 && high < nums.length && nums[high] == target)
            return high;
        else
            return -1;
    }

    public int[] searchRange(int[] nums, int target) {
        int res[] = new int[2];
        res[0] = findLeft(nums, target);
        res[1] = findRight(nums, target);
        return res;
    }
}

相关文章推荐

【LeetCode】34. Search for a Range

题目描述Given an array of integers sorted in ascending order, find the starting and ending position of a...

leetcode34_Search for a Range

一.问题描述 Given a sorted array of integers, find the starting and ending position of a given targe...

leetcode Search for a Range

题目:https://oj.leetcode.com/problems/search-for-a-range/ 思路:这道题就是让用二分查找法去搜第一个和最后一个值为target的数 这里相当于用了两...

LeetCode 34 Search For A Range 二叉查找相关(二)

题目: https://leetcode.com/problems/search-for-a-range/ Given a sorted array of integers, find the s...

LeetCode: Search for a Range 解题报告

Search for a Range Given a sorted array of integers, find the starting and ending position of a g...

leetcode:34. Search for a Range

Given an array of integers sorted in ascending order, find the starting and ending position of a giv...
  • Earl211
  • Earl211
  • 2017年03月15日 13:54
  • 185

[Leetcode]Search for a Range

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

【LeetCode-面试算法经典-Java实现】【034-Search for a Range(搜索一个范围)】

【034-Search for a Range(搜索一个范围)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a sorted array of intege...

[C++]LeetCode: 65 Search for a Range

题目: Given a sorted array of integers, find the starting and ending position of a given target value...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Search for a Range
举报原因:
原因补充:

(最多只允许输入30个字)