Search for a Range

    public int[] searchRange(int[] A, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        return searchRange(A, target, 0, A.length - 1);
    }
    
    public int[] searchRange(int[] A, int target, int start, int end) {
        if(start > end) return new int[]{-1, -1};
        if(A[start] == target && A[end] == target) return new int[]{start, end};
        int middle = start + (end - start) / 2;
        if(A[middle] < target) return searchRange(A, target, middle + 1, end);
        else if(A[middle] > target) return searchRange(A, target, start, middle - 1);
        else {
            int[] left = searchRange(A, target, start, middle);
            int[] right = searchRange(A, target, middle + 1, end);
            if(right[0] == -1) return left;
            else return new int[]{left[0], right[1]};
        }
    }



    //this is very tricky
    public int[] searchRange(int[] A, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int[] result = {-1, -1};
        if(A.length == 0) return result;
        int start = searchRange(A, target - 0.5);
        if(start >= A.length || A[start] != target) return result; // this is very important, be careful.
        result[0] = start;
        result[1] = searchRange(A, target + 0.5) - 1;
        return result;
    }
    
    public int searchRange(int[] A, double target) {
        int start = 0;
        int end = A.length - 1;
        while(start <= end) {
            int middle = start + (end - start) / 2;
            if(A[middle] > target) end = middle - 1;
            else if(A[middle] < target) start = middle + 1;
        }
        return start;
    }