Leetcode-JavaScript/Two Sum.js at master · parshva45/Leetcode-JavaScript · GitHub

23 lines (19 loc) · 661 Bytes

/*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, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,

return [0, 1].*/

/**

* @param {number[]} nums

* @param {number} target

* @return {number[]}

var twoSum = function(nums, target) {

var index = {}

for(var i = 0; i < nums.length; i++) {

var matchNum = target - nums[i];

if(typeof index[matchNum] === 'number') return [index[matchNum], i]

index[nums[i]] = i;

}

};

Expand file tree