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].
Your runtime beats 78.75% of javascriptsubmissions.
/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
var twoSum = function(nums, target) {
var obj = {};
var ll = nums.length;
for(var i=0;i<ll;i++){
var num = nums[i];
if(typeof obj[target-num]==="undefined"){
obj[num]=i;
}else{
return [obj[target-num],i];
}
}
};