题目描述:
Design and implement a TwoSum class. It should support the following operations:add and find.
add - Add the number to an internal data structure.
find - Find if there exists any pair of numbers which sum is equal to the value.
For example,
add(1); add(3); add(5);
find(4) -> true
find(7) -> false
解题思路:
用哈希表的解法,我们把每个数字和其出现的次数建立映射,然后我们遍历哈希表,对于每个值,我们先求出此值和目标值之间的差值t,然后我们需要分两种情况来看:
- 如果当前值不等于差值t,那么只要哈希表中有差值t就返回True,
- 当差值t等于当前值时,如果此时哈希表的映射次数大于1,则表示哈希表中还有另一个和当前值相等的数字,二者相加就是目标值
代码:
public class TwoSum {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
public void add(int number) {
if(map.containsKey(number)) {
map.put(number, map.get(number) + 1);
} else {
map.put(number, 1);
}
}
public boolean find(int value) {
for(int key : map.keySet()) {
int another = value - key;
if(another == key && map.get(key) > 1) {
return true;
} else if(another != key && map.containsKey(another)) {
return true;
}
}
return false;
}
}