[leetcode]1. Two Sum -- JavaScript 代码

/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
var twoSum = function(nums, target) {
var len = nums.length;
var map = {};
for(var i=0;i<len;i++){
cur = nums[i];
if(map[cur]){
map[cur].push(i);
}else{
map[cur] = [i];
}
}
for(var key in map){
if(map[target-key]){
if(target-key == key){
return [map[key][0],map[key][1]];
}
return [map[key][0],map[target-key][0]];
}
}
};