题解 | #两数之和#

import java.util.*;


public class Solution {
    /**
     * 
     * @param numbers int整型一维数组 
     * @param target int整型 
     * @return int整型一维数组
     */
    public int[] twoSum (int[] numbers, int target) {
        // write code here
        //使用一个haspmap保存当前值与目标值的差值，同时保存当前下标
        
        int[] res = new int[2];
        Map<Integer,Integer> map = new HashMap<>();
        int len = numbers.length;
        if(len<1) return res;
        for(int i = 0;i < len;i++){
            int temp = target-numbers[i];
            if(map.containsKey(numbers[i])){
                res[0] = map.get(numbers[i])+1;
                res[1] = i+1;
                break;
            }else{
                map.put(temp,i);
            }   
        }
        return res;
    }
}