题解 | #两数之和#

import java.util.*;


public class Solution {
    /**
     * 
     * @param numbers int整型一维数组 
     * @param target int整型 
     * @return int整型一维数组
     */
    public int[] twoSum (int[] shu, int x) {
        TreeMap<Integer, Integer> mp = new TreeMap<Integer, Integer>();
        int len = shu.length;
        for(int i = 0; i < len; i ++)
        {
            if(mp.containsKey(x - shu[i]))
                return new int[]{mp.get(x - shu[i]) + 1, i + 1};
            else
                mp.put(shu[i], i);
        }
        return null;
    }
}