[leet] two sum (easy)

Author: hyeonbinHur

허현빈/6주차/260202-1.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
+    const map = new Map()
+  
+    for(let i = 0; i < nums.length; i++){
+        map.set(nums[i], i); 
+    }
+    
+    for(let i = 0; i < nums.length; i++){
+        const val = nums[i];
+        const complement = target - val; 
+        
+        if(map.has(complement) && map.get(complement) !== i){
+            return [i, map.get(complement)];
+        }
+    }
+};

허현빈/6주차/260202-2.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
+    const indexedNums = nums.map((val, idx) => ({ val, idx }));
+    
+    indexedNums.sort((a, b) => a.val - b.val);
+    
+    let left = 0;
+    let right = nums.length - 1;
+    
+    while (left < right) {
+        const sum = indexedNums[left].val + indexedNums[right].val;
+        
+        if (sum === target) {
+            return [indexedNums[left].idx, indexedNums[right].idx];
+        } else if (sum < target) {
+            left++; 
+        } else {
+            right--;
+        }
+    }
+};