working...

Author: imtomq

add-two-numbers.js

@@ -11,6 +11,8 @@
  * @return {ListNode}
  */
 
+// https://leetcode.com/problems/add-two-numbers/
+
 function ListNode(val, next) {
   this.val = val === undefined ? 0 : val;
   this.next = next === undefined ? null : next;

find-original-array-from-doubled-array.js

@@ -2,6 +2,9 @@
  * @param {number[]} changed
  * @return {number[]}
  */
+
+// https://leetcode.com/problems/find-original-array-from-doubled-array/
+
 var findOriginalArray = function (changed) {
   if (changed.length % 2 !== 0) return [];
   let result = [];

merge-two-sorted-lists.js

@@ -11,6 +11,8 @@
  * @return {ListNode}
  */
 
+// https://leetcode.com/problems/merge-two-sorted-lists/
+
 function ListNode(val, next) {
   this.val = val === undefined ? 0 : val;
   this.next = next === undefined ? null : next;

remove-duplicates-from-sorted-list.js

@@ -9,6 +9,9 @@
  * @param {ListNode} head
  * @return {ListNode}
  */
+
+// https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+
 var deleteDuplicates = function (head) {
   const listnode = new ListNode(null);
   let prev = listnode;

two-sum.js

@@ -4,14 +4,16 @@
  * @return {number[]}
  */
 
-var twoSum = function(nums, target) {
-    const hashMap = {};
+// https://leetcode.com/problems/two-sum/
 
-    for (let i = 0; i< nums.length; i++) {
-       const num = nums[i];
-       if ( hashMap[num] >= 0 ) {
-            return [hashMap[num], i];
-        }
-        hashMap [target - num] = i;
+var twoSum = function (nums, target) {
+  const hashMap = {};
+
+  for (let i = 0; i < nums.length; i++) {
+    const num = nums[i];
+    if (hashMap[num] >= 0) {
+      return [hashMap[num], i];
     }
+    hashMap[target - num] = i;
+  }
 };

valid-parentheses.js

@@ -2,6 +2,9 @@
  * @param {string} s
  * @return {boolean}
  */
+
+// https://leetcode.com/problems/valid-parentheses/
+
 var isValid = function (s) {
   const match = {
     "{": "}",