[Blind 75]Array: 1. Two Sum

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer, Integer> table = new HashMap<>();
        for(int i = 0; i < nums.length; i++){
            if(table.containsKey(target - nums[i])){
                return new int[]{table.get(target-nums[i]), i};
            }
            table.put(nums[i], i);
            
        }
        return null;


    }
}

在这道题主要学到的一个新的用法就是

return new int[]{table.get(target-nums[i]), i};