两数之和 -- map计算

class Solution {
    public int[] twoSum(int[] nums, int target) {
        /*
            Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            int complement = target - nums[i];
            if (map.containsKey(complement)) {
                return new int[] { map.get(complement), i };
            }
            map.put(nums[i], i);
        }
        throw new IllegalArgumentException("No two sum solution");
        
        */
        Map<Integer,Integer> map = new HashMap<>();
        for(int i = 0 ; i < nums.length ; i++){
            int com = target - nums[i];
            if(map.containsKey(com)){
                return new int[] { map.get(com) , i };
            }
            map.put(nums[i] , i);
        }
        return null;
    }
}