TwoPointers
CrazyAoli
这个作者很懒,什么都没留下…
展开
-
[TwoPointers][2]Lintcode587. Two Sum - Unique pairs
Amazon | OA 2019 | Two Sum - Unique PairsGiven 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 = 47Out原创 2021-02-01 03:27:37 · 213 阅读 · 0 评论 -
[Two Pointers][1]Leetcode170. Two Sum III - Data structure design
Leetcode170. Two Sum III - Data structure designSolution1: HashMapclass TwoSum { private HashMap<Integer, Integer> map; /** Initialize your data structure here. */ public TwoSum() { map = new HashMap<>(); }原创 2021-01-31 23:48:07 · 116 阅读 · 0 评论