Merge branch 'master' of github.com:everthis/leetcode-js

Author: everthis

1.two-sum.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+const twoSum = function(nums, target) {
+  const myObject = {};
+  for (let i = 0; i < nums.length; i++) {
+    const complement = target - nums[i];
+    if (myObject.hasOwnProperty(complement)) {
+      return [myObject[complement], i];
+    }
+    myObject[nums[i]] = i;
+  }
+};

2-add-two-numbers.js

@@ -0,0 +1,47 @@
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} l1
+ * @param {ListNode} l2
+ * @return {ListNode}
+ */
+const addTwoNumbers = function(l1, l2) {
+  const res = new ListNode(null);
+  single(l1, l2, res);
+  return res.next;
+};
+
+function single(l1, l2, res) {
+  let cur;
+  let addOne = 0;
+  let sum = 0;
+  let curVal = 0;
+  while (l1 || l2 || addOne) {
+    sum = ((l1 && l1.val) || 0) + ((l2 && l2.val) || 0) + addOne;
+    if (sum / 10 >= 1) {
+      curVal = sum % 10;
+      addOne = 1;
+    } else {
+      curVal = sum;
+      addOne = 0;
+    }
+
+    if (cur) {
+      cur = cur.next = new ListNode(curVal);
+    } else {
+      cur = res.next = new ListNode(curVal);
+    }
+
+    if (l1) {
+      l1 = l1.next;
+    }
+    if (l2) {
+      l2 = l2.next;
+    }
+  }
+}