public class Solution {
/** 
 *@param A : an integer sorted array
 *@param target :  an integer to be inserted
 *return : a list of length 2, [index1, index2]
 */
public int[] searchRange(int[] A, int target) {
    // write your code here
    int[] result = new int[2];
    result[0] = -1;
    result[1] = -1;
    if (A == null) return result;
    int length = A.length;
    if (length == 0) return result;
    int start = 0;
    int end = length - 1;
    while (start + 1 < end) {
        int mid = start + (end - start) / 2;
        if (A[mid] == target) end = mid;
        else if (A[mid] > target) end = mid;
        else start = mid;
    }
    if (A[start] == target) result[0] = start;
    else if (A[end] == target) result[0] = end;
    else return result;
    start = 0;
    end = length - 1;
    while (start + 1 < end) {
        int mid = start + (end - start) / 2;
        if (A[mid] == target) start = mid;
        else if (A[mid] > target) end = mid;
        else start = mid;
    }
    if (A[end] == target) result[1] = end;
    else result[1] = start;
    return result;
}
}