88、在排序数组中查找元素的第一个和最后一个位置

题目描述：
给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

你的算法时间复杂度必须是 O(log n) 级别。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]
可能有些冗余
代码：

class Solution {
    public int[] searchRange(int[] nums, int target) {
       if(nums.length == 0){
			return new int[]{-1,-1};
		}
		if(nums.length == 1 && nums[0] == target){
			return new int[]{0,0};
		}
		if(target < nums[0] || nums[nums.length - 1] < target){
			return new int[]{-1,-1};
		}
		int start = 0;
		int end = nums.length - 1;
		int x = -1;
		int mid = 0;
		while (start < end) {
			if(nums[start] == target){
				x = start;
				break;
			}else if(nums[end] == target) {
				x = end;
				break;
			}
			mid = start + (end - start) / 2;
			System.out.println(nums[mid]);
			if(target == nums[mid]){
				x = mid;
				break;
			}
			if(target > nums[mid]){
				start = mid + 1;
			}else {
				end = mid - 1;
			}
		}
		if(x == -1){
			return new int[]{-1,-1};
		}
	start = x;
		while (start >= 0 && nums[start] == target) {
			start --;
		}
		end = x;
		while (end < nums.length && nums[end] == target) {
			end ++;
		}
		
		return new int[]{start + 1,end - 1};
        
    }
}

精简过后的代码：

class Solution {
    public int[] searchRange(int[] nums, int target) {
       if(nums.length == 0){
			return new int[]{-1,-1};
		}
		
		int start = 0;
		int end = nums.length - 1;
		int x = -1;
		int mid = 0;
		while (start <= end) {
			if(nums[start] == target){
				x = start;
				break;
			}else if(nums[end] == target) {
				x = end;
				break;
			}
			mid = start + (end - start) / 2;
			if(target == nums[mid]){
				x = mid;
				break;
			}
			if(target > nums[mid]){
				start = mid + 1;
			}else {
				end = mid - 1;
			}
		}
		if(x == -1){
			return new int[]{-1,-1};
		}
	start = x;
		while (start >= 0 && nums[start] == target) {
			start --;
		}
		end = x;
		while (end < nums.length && nums[end] == target) {
			end ++;
		}
		
		return new int[]{start + 1,end - 1};
        
    }
}

排名靠前的代码：

class Solution {
    public int[] searchRange(int[] nums, int target) {
        int[] res = {-1,-1};
        if(nums == null || nums.length == 0){
            return res;
        }
        int left = 0;
        int right = nums.length - 1;
        while(left < right){
            int mid = left + (right - left)/2;
            if(nums[mid] >= target){
                right = mid;
            }
            else{
                left = mid + 1;
            }
        }
        if(nums[left] == target){
            res[0] = left;
            right = nums.length - 1;
            while(left < right){
                int mid = left + (right - left)/2;
                if(nums[mid] == target && nums[mid+1] !=target){
                    left = mid;
                    break;
                }
                if(nums[mid] != target){
                    right = mid;
                }
                else{
                    left = mid + 1;
                }
            }
        }
        if(nums[left] == target){
            res[1] = left;
        }
        return res;
    }
}