LeetCode力扣之Search for a Range

Given an array of integers sorted in ascending order, 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].

/**
 * Created by lxw, liwei4939@126.com on 2018/3/6.
 */
public class L034_Search_for_Range {

    public int[] searchRandom(int[] nums, int taget){

        int start =0, end = nums.length - 1;

        while (start <= end){
            int mid = start + (end - start) / 2;
            if (nums[mid] == taget){
                int s = mid, e = mid;

                while (s - 1 >= 0 && nums[s-1] == taget){
                    s--;
                }

                while (e + 1 <nums.length && nums[e + 1] == taget){
                    e++;
                }
                return new int[]{s, e};

            } else if (nums[mid] > taget){
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }

        return new int[]{-1, -1};
    }

    public static void main(String[] args){

        L034_Search_for_Range tmp = new L034_Search_for_Range();
        int[] arr = new int[]{5, 7, 7, 8, 8, 10};
        int[] res = tmp.searchRandom(arr, 8);

        for (int each: res){
            System.out.print(each + ", ");
        }
    }
}