是否存在两个树的和是固定数 hashmap使用 leecode

two sum https://oj.leetcode.com/submissions/detail/8220548/

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int a[]=new int[2];
        
        HashMap<Integer,Integer> hash=new HashMap<Integer,Integer>();
        for(int i=0;i<numbers.length;i++)
        {
            if(hash.containsKey(numbers[i]))
            {
                
             int end=hash.get(numbers[i])+1;
             int beg=i+1;
             a[0]=end;
             a[1]=beg;
             break;
            }
            else
            {
                hash.put(target-numbers[i],i);
            }
            
            
            
        }
        return a;
        
    }
}