Leetcode 170:two Sum iii-data structure Design

The Sum iii-data structure designTotal 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 are equal to the value.

For example,

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 { C5/>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.contain SKey (another)) {            return true;        }    }    return false;}}

Leetcode 170:two Sum iii-data structure Design