p128 设计一个类求和为给定值的两个数(lintcode 607)

class TwoSum 
{
private:
    vector<int> data;
public:
    void add(int number) 
    {
        data.push_back(number);
    }

    bool find(int value)
    {
        set<int> s;
        for (int num : data)
        {
            if (s.count(value - num) != 0) return true;
            s.insert(num);
        }

        return false;
    }
};

public class TwoSum {
        private List<Integer> data=new ArrayList<>();
        
        public void add(int number) 
        {
              data.add(number);   
        }

       
        public boolean find(int value) 
        {
               Set<Integer> s=new HashSet<>();
               for(int num:data)
               {
                   if(s.contains(value-num)) return true;
                   s.add(num);
               }
               
               return false;
        }
    }