Two Sum

 1 public class Solution {
 2     public int[] twoSum(int[] numbers, int target) {
 3         HashMap<Integer, Integer> visited = new HashMap<Integer, Integer>();
 4         int[] result = new int[2];
 5         for(int i = 0; i < numbers.length; i++){
 6             int tmp = target - numbers[i];
 7             if(visited.containsKey(tmp)){
 8                 result[0] = visited.get(tmp)+1;
 9                 result[1] = i + 1;
10             }
11             else
12                 visited.put(numbers[i], i);
13         }
14         return result;
15     }
16 }
【推广】 免费学中医，健康全家人
原文地址：https://www.cnblogs.com/jasonC/p/3450968.html