public int[] twoSum(int[] numbers, int target) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		// Arrays.sort(numbers);
		int[] res = new int[2];
		for (int i = 0; i < numbers.length; ++i) {
			int subTarget = target - numbers[i];
			int idx1 = biSearch(numbers, 0, i - 1, subTarget);
			if (idx1 != -1) {
				res[0] = Math.min(i, idx1) + 1;
				res[1] = Math.max(i, idx1) + 1;
				break;
			}
			int idx2 = biSearch(numbers, i + 1, numbers.length - 1, subTarget);
			if (idx2 != -1) {
				res[0] = Math.min(i, idx2) + 1;
				res[1] = Math.max(i, idx2) + 1;
				break;
			}
		}
		return res;
	}