public int[] searchRange(int[] A, int target) {
		int[] result = new int[] { -1, -1 };
		if (A == null || A.length == 0) {
			return result;
		}
		int pos = binarySearch(A, target, 0, A.length - 1);
		if (pos == -1) {
			return result;
		}
		int start = pos;
		int end = pos;
		while (start >= 0 && A[start] == target) {
			start--;
		}
		while (end <= A.length - 1 && A[end] == target) {
			end++;
		}
		result[0] = start + 1;
		result[1] = end - 1;
		return result;
	}