剑指-006

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < numbers.length; i++){
            map.put(numbers[i], i);
        }
        for(int i = 0; i < numbers.length; i++){
            if(map.keySet().contains(target - numbers[i])){
                return new int[]{i, map.get(target - numbers[i])};
            }
        }
        return new int[]{0, 0};
    }
}