public int[] searchRange(int[] nums, int target) {
		int[] a = new int[2];
		int index = findIndex(nums, 0, nums.length - 1, target);
		if (index == -1) {
			a[0] = -1;
			a[1] = -1;
			return a;
		}
		int left = index;
		while (left >= 0 && nums[left] == target) {
			--left;
		}
		a[0] = ++left;
		int right = index;
		while (right < nums.length && nums[right] == target) {
			++right;
		}
		a[1] = --right;
		return a;
	}