給定一個整數陣列和一個目標值，找出陣列中和為目標值的兩個數。 你可以假設每個輸入只對應一種答案，且同樣的元素不能被重複利用

public class Solution {
    public static void main(String[] args) {
        int[] num = {2, 7, 11, 15};
        int[] ints = twoSum(num, 9);
        for (int i = 0; i < ints.length; i++) {
            System.out.println(ints[i]);
        }
    }

    public static int[] twoSum(int[] nums, int target) {
        int[] postions = new int[2];
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            map.put(nums[i], i);
        }
        for (int j = 0; j < nums.length; j++) {
            int anotherValue = target - nums[j];
            if (map.containsKey(anotherValue) && map.get(anotherValue) != j) {
                int anotherPos = map.get(anotherValue);
                postions[0] = j;
                postions[1] = anotherPos;
                break;
            }
        }
        return postions;
    }
}複製程式碼