chenxinjk2的专栏

Amazon | OA 2019 | Two Sum - Unique Pairs Given an int array nums and an int target, find how many unique pairs in the array such that their sum is equal to target. Return the number of pairs. Example 1: Input: nums = [1, 1, 2, 45, 46, 46], target = 47 Out

Leetcode170. Two Sum III - Data structure design Solution1: HashMap class TwoSum { private HashMap<Integer, Integer> map; /** Initialize your data structure here. */ public TwoSum() { map = new HashMap<>(); }