public int[] twoSum(int[] numbers, int target) {

		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		int[] ret = new int[2];
		for (int i = 0; i < numbers.length; i++) {
			int cur = numbers[i];
			if (map.containsKey(target - cur)) {

				ret[0] = map.get(target - cur) + 1;
				ret[1] = i + 1;
				break;

			}
			map.put(cur, i);
		}
		return ret;

	}