LeetCode-1 Two Sum Solution (with Java)

1. Description: 

2.Solutions:

/**
 * Created by sheepcore on 2019-01-23
 */
class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i]))
                return new int[] { map.get(target - nums[i]), i };
            else
                map.put(nums[i], i);
        }
        return new int[] {-1, -1};
    }
}