LeetCode Two Sum

原题链接: http://oj.leetcode.com/problems/two-sum/

public int[] twoSum(final int[] numbers, int target) {int[] ret = new int[2];Map<Integer, Integer> map = new HashMap<Integer, Integer>();for (int i = 0; i < numbers.length; i++) {if (map.containsKey(target - numbers[i])) {ret[0] = map.get(target - numbers[i]) + 1;ret[1] = i + 1;break;}map.put(numbers[i], i);}return ret;}