leetcode 34. Search for a Range

34. Search for a Range

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

在数组中查找数，一次遍历时间复杂度是O(n)。对于有序的数组还是用二分搜索。

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