LeetCode 170 - Two Sum III - Data structure design

最新推荐文章于 2021-02-08 05:00:29 发布

yuanhisn

最新推荐文章于 2021-02-08 05:00:29 发布

阅读量82

点赞数

分类专栏： LeetCode+ 文章标签： hashmap twosum

本文链接：https://blog.csdn.net/yuanhisn/article/details/84702714

版权

LeetCode+ 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

Map<Integer, Integer> dict = new HashMap<Integer, Integer>();

public void add(int number) {
	if (dict.containsKey(number)) {
		dict.put(number, dict.get(number) + 1);
	} else {
		dict.put(number, 1);
	}
}

public boolean find(int value) {
	for (Integer key : dict.keySet()) {
		if (value - key == key) {
			if (dict.get(key) >= 2) {
				return true;
			}
		} else if (dict.containsKey(value - key)) {
			return true;
		}
	}

	return false;
}