Lintcode61 Search for a Range solution 题解

【题目描述】

Given a sorted array of n integers, find the starting and ending position of a given target value.If the target is not found in the array, return [-1, -1].

给定一个包含 n 个整数的排序数组，找出给定目标值 target 的起始和结束位置。如果目标值不在数组中，则返回[-1, -1]

【题目链接】

www.lintcode.com/en/problem/search-for-a-range/

【题目解析】

这题要求在一个排好序可能有重复元素的数组里面找到包含某个值的区间范围。要求使用O(log n)的时间，所以我们采用两次二分查找。首先二分找到第一个该值出现的位置，譬如m，然后在[m, n)区间内第二次二分找到最后一个该值出现的位置。

【参考答案】

www.jiuzhang.com/solutions/search-for-a-range/

转载于:https://blog.51cto.com/12902480/1959533

Lintcode61 Search for a Range solution 题解相关推荐

LeetCode - 34. Search for a Range
34. Search for a Range Problem's Link -------------------------------------------------------------- ...
LeetCode 34. Search for a Range
LeetCode 34. Search for a Range Solution1:我的答案竟然超过了100%,啊哈哈哈哈哈 class Solution { public:vector<in ...
Lintcode132 Word Search || solution 题解
[题目描述] Given a matrix of lower alphabetsand a dictionary.Find all words in the dictionary that can b ...
34. Search for a Range
一句话思路:新建数组存储位置,输出数组一刷报错: 是nums[mid],nums[start/end]和target的关系,不是mid start end和target的关系右边界 start e ...
二分法：查找区间search for a range
问题描述: 给定一个排序数组nums(nums中有重复元素)与目标值target,如果 target在nums里出现,则返回target所在区间的左右端点下标,[左端点, 右端点],如果target在 ...
Lintcode18 Subsets II solution 题解
[题目描述] Given a list of numbers that may has duplicate numbers, return all possible subsets Notice:Ea ...
【leetcode】Search for a Range
题目描述: Given a sorted array of integers, find the starting and ending position of a given target valu ...
[LeetCode] Search for a Range [34]
题目 Given a sorted array of integers, find the starting and ending position of a given target value. ...
Lintcode42 Maximum Subarray II solution 题解
[题目描述] Given an array of integers, find two non-overlapping subarrays which have the largest sum.The ...

Lintcode61 Search for a Range solution 题解

Lintcode61 Search for a Range solution 题解相关推荐

最新文章

热门文章