题解 | #两数之和#

import java.util.*;

public class Solution {

 public int[] twoSum(int[] numbers, int target) {
    HashMap<Integer, Integer> map = new HashMap<>();

    for (int i = 0; i < numbers.length; i++) {
    //判断map中是否存在target-numbers[i]的差值
        if (map.containsKey(target - numbers[i])) { 
        //若是存在差值，则返回下标，记得+1
            return new int[]{map.get(target - numbers[i]) + 1, i+1}; 
        }
        //若不存在差值，继续将数组的值添加到map集合中
        map.put(numbers[i],i);
    }
    return new int[]{0, 0};
}

}