leetCodeOJ_TwoSum

Problem：

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

My Java Solution：

public class Solution { public int[] twoSum(int[] nums, int target) {
    HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
    int[] result = {0,0};

    for(int i = 0; i < nums.length; i++) {
        if(map.get(nums[i]) != null) {
            int[] result = {map.get(nums[i])+1,i+1};
            return result;
        }
        map.put(target-nums[i], i);//相当于前面的数字被放进map里面，这样可以保证后期get的时候，下标大于第一个下标
    }
    return eresult;
    }
}

Points:
HashMap常用操作是put(key,value)和get(key)两个方法。
put过程：

http://blog.csdn.net/ghsau/article/details/16843543，转载请注明。” title=”” />