submit

Author: 谭佳胜

Two Sum/index.js 1. Two Sum/index.jsTwo Sum/index.js renamed to 1. Two Sum/index.js

@@ -0,0 +1,34 @@
+const operate = function(a, b, operator) {
+    switch (operator) {
+        case '+':
+            return a + b;
+        case '-':
+            return a - b;
+        case '*':
+            return a * b;
+        case '/':
+            return parseInt(a / b);
+        default:
+            return;
+    }
+}
+const calculate = function(s) {
+    const reg = /^(\s?\-?\d+\s?)(\+|\-|\*|\/)(\s?\d+\s?)(\+|\-|\*|\/)?(\s?\d+)?/;
+    const operatorReg = /\+|\-|\*|\//;
+    
+    while (+s !== +s) {
+        s = s.replace(reg, (match, $1, $2, $3, $4, $5) => {
+            if (!$4 && !$5) {
+                return operate(+$1, +$3, $2);
+            } else {
+                if (/\*|\//.test($4) && !/\*|\//.test($2)) {
+                    return `${$1}${$2}${operate(+$3, +$5, $4)}`;
+                } else {
+                    return `${operate(+$1, +$3, $2)}${$4}${$5}`;
+                }
+            }
+        });
+    }
+    
+    return +s;
+};

Two Sum/readme.md 1. Two Sum/readme.mdTwo Sum/readme.md renamed to 1. Two Sum/readme.md

@@ -0,0 +1,7 @@
+const addDigits = function(num) {
+    while (num >= 10) {
+        num = String(num).split('').reduce((pre, cur) => Number(pre) + Number(cur))
+    }
+    
+    return num;
+};

…nary Tree Level Order Traversal/index.js …nary Tree Level Order Traversal/index.jsBinary Tree Level Order Traversal/index.js renamed to 102. Binary Tree Level Order Traversal/index.js Binary Tree Level Order Traversal/index.js renamed to 102. Binary Tree Level Order Traversal/index.js

@@ -0,0 +1,12 @@
+const removeDuplicates = function(nums) {
+    let count = 0;
+    
+    for (let i = 0; i < nums.length; i++) {
+        if (nums[i] !== nums[i + 1]) {
+            count++;
+            nums[count] = nums[i + 1]
+        }
+    }
+    
+    return count;
+};