/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
var twoSum = function(nums, target) {
var answer = [];
var hashTable = nums.reduce((obj, num, idx) => {
obj[num] = idx;
return obj;
}, {});
for(let i=0; i < nums.length; i++) {
if (hashTable[target - nums[i]] !== undefined && hashTable[target - nums[i]] !== i) {
answer.push(i, hashTable[target - nums[i]]);
break;
}
}
return answer;
};'알고리즘 > LeetCode' 카테고리의 다른 글
| [Leetcode][Javascript][Medium] 7. Reverse Integer (0) | 2021.07.04 |
|---|---|
| [Leetcode][Javascript][Medium] 2. Add Two Numbers (0) | 2021.07.02 |
| [Leetcode][Javascript][Easy] 155. Min Stack (0) | 2021.06.30 |
| [Leetcode][Javascript][Easy] 20. Valid Parentheses (0) | 2021.06.28 |
| [Leetcode][Javascript][Easy] 70. Climbing Stairs (0) | 2021.05.16 |
댓글