Two Sum III - Data structure design

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存储值，然后判断value-num == num的情况下，count是否> 1.

class TwoSum {

    private HashMap<Integer, Integer> hashmap;
    public TwoSum() {
        this.hashmap = new HashMap<>();
    }
    
    public void add(int number) {
        hashmap.put(number, hashmap.getOrDefault(number, 0) + 1);
    }
    
    public boolean find(int value) {
        for(Integer key: hashmap.keySet()) {
            int j = value - key;
            if((key != j && hashmap.get(j) != null) || (j == key && hashmap.get(j) > 1)) {
                return true;
            } 
        }
        return false;
    }
}

/**
 * Your TwoSum object will be instantiated and called as such:
 * TwoSum obj = new TwoSum();
 * obj.add(number);
 * boolean param_2 = obj.find(value);
 */