leetcode 170: Two Sum III - Data structure design

最新推荐文章于 2019-03-25 10:53:17 发布

原创最新推荐文章于 2019-03-25 10:53:17 发布 · 9.2k 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍如何设计并实现一个TwoSum类，该类支持添加数值和查找特定数值是否存在两个数之和等于目标值的功能。利用哈希表实现O(N)的存储和O(1)的查找效率。

Two Sum III - Data structure design

Total Accepted: 311 Total Submissions: 1345

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

[分析]
HASH table O(N)存, O(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;
	}
}