[LeetCode][JavaScript]Two Sum

Two Sum

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

https://leetcode.com/problems/two-sum/

---

提示用map做，暴力O(n^2)也能解。

有个case比较狡猾，中招了。

Input: [-3,4,3,90], 0
Output: undefined
Expected: [1,3]

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    var map = {};
    for(var i in nums){
        if(map[nums[i]] !== undefined){
            return [parseInt(map[nums[i]]) + 1, parseInt(i) + 1];
        }else{
            map[target - nums[i]] = i;
        }   
    }
};

function test(){    
    console.log(twoSum([3,4,-3,90], 0));  //13
    console.log(twoSum([2,7,11,15], 9));  //12
    console.log(twoSum([0,4,3,9], 9));  //14
    console.log(twoSum([0,4,3,0], 0));  //14
    console.log(twoSum([-3,4,3,90], 0));  //13
}