leetcode_01 L两数之和

public class code_01 {
    public static int[] num(int nums[],int k){
        HashMap<Integer, Integer> hashMap = new HashMap<>();
        for(int i=0;i<nums.length;i++){
           if(hashMap.containsKey(k-nums[i])){
               return new int[]{hashMap.get(k-nums[i]),i};
           }
           hashMap.put(nums[i],i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
    public static void main(String[] args) {
        
    }
}