Leetcode 34, Search for a Range

    public int[] searchRange(int[] nums, int target) {
        if(nums == null || nums.length == 0){
        	return null;
        }
    	
        int[] result = {-1, -1};
    	//binary search, 2 times
    	int start = 0;
    	int end = nums.length - 1;
    	
	    while(start <= end){
	        int mid = start + (end - start) / 2;
	        if(nums[mid] > target){
	            end = mid - 1;
	        }else if(nums[mid] < target){
	            start = mid + 1;
	        }else{
	        	result[0] = mid;
	        	end = mid - 1;
	        }
	    }

	    start = 0;
    	end = nums.length - 1;
	    while(start <= end){
	    	int mid = start + (end - start) / 2;
	        if(nums[mid] < target){
	            start = mid + 1;
	        }else if(nums[mid] > target){
	            end = mid - 1;
	        }else{
	        	result[1] = mid;
	        	start = mid + 1;
	        }
	    }
    	
    	return result;
    }