170. 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.

add(1); add(3); add(5);
find(4) -> true
find(7) -> false

public class TwoSum {
    List<Integer> list=new ArrayList<>();
    Map<Integer,Integer> map=new HashMap<>();
    /** Initialize your data structure here. */
    
    /** Add the number to an internal data structure.. */
    //把数存list里
    //把数存在map，key为这个数，value为这个数出现的次数
    public void add(int number) {
        list.add(number);
        if(map.containsKey(number)){
            map.put(number,map.get(number)+1);
        }
        else{
            map.put(number,1);
        }
    }
    
    /** Find if there exists any pair of numbers which sum is equal to the value. */
    //循环一遍a=list.get(i)
    //找b=value-a这个数在不在map里
    //1.a=b且a出现了两次：true
    //2.a!=b且b出现在map里：true
    public boolean find(int value) {
        for(int a: map.keySet()){
        int b=value-a;
        if( ((a==b)&&(map.get(a)>1)) || ((a!=b)&&(map.containsKey(b))) ){
            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);
 */