Leetcode 1 two-sum

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