Easy 170题 Two Sum III - Data structure design

Question:

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

Solution:

public class TwoSum {
    private List<Integer> ans=new ArrayList<Integer>();
    private Map<Integer, Integer> map= new HashMap<Integer,Integer>();
    // Add the number to an internal data structure.
	public void add(int number) {
	    ans.add(number);
	}

    // Find if there exists any pair of numbers which sum is equal to the value.
	public boolean find(int value) {
	    for(int i=0;i<=ans.size()-1;i++)
	    {
	        if(map.containsKey(value-ans.get(i))&&i!=map.get(value-ans.get(i)))
	            return true;
	        else
	            map.put(ans.get(i),i);
	    }
	    return false;
	}
}


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

发觉没有根据value找key的方法