本题题目要求如下:
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基本思路就是用hashmap来存储,key是存储的值,而value是存储的次数,这样,如果3的value是2,则6可以用3+3实现。。。
所以add的时间复杂度是O(1),而find的时间复杂度是O(n),这个需要注意一些细节,这题leetcode设计的时间范围不是很好,如果多用了个if,else,可能就过不了,要尽量写出最简代码,代码如下:
class TwoSum {
public:
void add(int number) {
hashmap[number]++;
}
bool find(int value) {
for (auto it = hashmap.begin(); it != hashmap.end(); ++it) {
auto got = hashmap.find(value - it->first);
if (got != hashmap.end() and (got != it or got->second > 1)) {
return true;
}
}
return false;
}
private:
unordered_map<int, int> hashmap;
};