leetcode Two Sum

问题描述

Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution.
Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

答案

public class Solution {
    public int[] twoSum(int[] numbers, int target) {
        if (numbers == null || numbers.length < 2) {
            return null;
        }
        HashMap<Integer, Integer> hs = new HashMap<Integer, Integer>();
        for (int i = 0; i < numbers.length; i++) {
            hs.put(numbers[i], i);
        }

        int[] a = new int[2];
        for (int i = 0; i < numbers.length; i++) {
            if (hs.containsKey(target - numbers[i])) {
                int index1 = i;
                int index2 = hs.get(target - numbers[i]);
                if (index1 == index2) {
                    continue;
                }
                a[0] = index1;
                a[1] = index2;
                return a;
            }
        }
        return a;  
    }
}