public int[] searchRange(int[] A, int target) {
		int n = A.length;
		int[] result = { -1, -1 };
		if (n == 0)
			return result;

		int i = searchLeft(A, target, -1, 0, n - 1);
		int j = searchRight(A, target, -1, 0, n - 1);

		result[0] = i;
		result[1] = j;

		return result;

	}