题解 | #两数之和#

import java.util.*;

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param numbers int整型一维数组
     * @param target int整型
     * @return int整型一维数组
     */
    public int[] twoSum (int[] numbers, int target) {
        int[] site = new int[2];
        Map<Integer, Integer> siteMap = new HashMap<Integer, Integer>();
        for (int i = 0; i < numbers.length; i++) {
            int temp = target - numbers[i];
            siteMap.put(temp, i + 1);
        }
        for (Map.Entry<Integer, Integer> entry : siteMap.entrySet()) {
            for (int i = 0; i < numbers.length; i++) {
                if (numbers[i] == entry.getKey() && i + 1 != entry.getValue()) {
                    site[0] = i + 1;
                    site[1] = entry.getValue();
                    doSwapSite(site);
                    return site;
                }
            }
        }

        return site;
    }
    void doSwapSite(int[] site) {
        if (site[0] > site[1]) {
            int temp = site[0];
            site[0] = site[1];
            site[1] = temp;
        }
    }
}