Search for a Range
Mar 3 '12
5829 / 15540
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[] searchRange(int[] A, int target) {
int[] res = {-1,-1};
if(A==null||A.length==0) return res;
......
阅读全文