💬 add rest

Author: gankaicode

100.相同的树.js

@@ -0,0 +1,28 @@
+/*
+ * @lc app=leetcode.cn id=100 lang=javascript
+ *
+ * [100] 相同的树
+ */
+
+// @lc code=start
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+function isSameTree(p, q) {
+    if (!p && !q) return true;
+    if (!p || !q || p.val !== q.val) return false;
+    
+    return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+  }
+// @lc code=end
+

20.有效的括号.js

@@ -61,43 +61,30 @@
  * @return {boolean}
  */
 var isValid = function (s) {
-    var st = []
-    // s = '()'
-    for (var l of s) {
-        // i = 0,1,2,3,4,5
-        if ((i = "({[]})".indexOf(l)) > -1) {
-            if (st[st.length - 1] + i === 5) {
-                st.length--;
-            } else {
-                st.push(i);
+   
+    let valid = true;
+    const stack = [];
+    const mapper = {
+        '{': "}",
+        "[": "]",
+        "(": ")"
+    }
+
+    for(let i in s) {
+        const v = s[i];
+        if (['(', '[', '{'].indexOf(v) > -1) {
+            stack.push(v);
+        } else {
+            const peak = stack.pop();
+            if (v !== mapper[peak]) {
+                return false;
             }
         }
     }
-    return st.length === 0
-
-    // let valid = true;
-    // const stack = [];
-    // const mapper = {
-    //     '{': "}",
-    //     "[": "]",
-    //     "(": ")"
-    // }
-
-    // for(let i in s) {
-    //     const v = s[i];
-    //     if (['(', '[', '{'].indexOf(v) > -1) {
-    //         stack.push(v);
-    //     } else {
-    //         const peak = stack.pop();
-    //         if (v !== mapper[peak]) {
-    //             return false;
-    //         }
-    //     }
-    // }
 
-    // if (stack.length > 0) return false;
+    if (stack.length > 0) return false;
 
-    // return valid;
+    return valid;
 };
 // @lc code=end
 

53.最大子序和.js

@@ -0,0 +1,24 @@
+/*
+ * @lc app=leetcode.cn id=53 lang=javascript
+ *
+ * [53] 最大子序和
+ */
+
+// @lc code=start
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSubArray = function(nums) {
+    var prev = 0;
+   var max = -Number.MAX_VALUE;
+
+   for (var i = 0; i < nums.length; i++) {
+       prev = Math.max(prev + nums[i], nums[i]);
+       max = Math.max(max, prev);
+   }
+   return max;
+};
+// @lc code=end
+

58.最后一个单词的长度.js

@@ -0,0 +1,16 @@
+/*
+ * @lc app=leetcode.cn id=58 lang=javascript
+ *
+ * [58] 最后一个单词的长度
+ */
+
+// @lc code=start
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var lengthOfLastWord = function(s) {
+    return s.trim().split(" ").pop().length;
+};
+// @lc code=end
+

66.加一.js

@@ -0,0 +1,26 @@
+/*
+ * @lc app=leetcode.cn id=66 lang=javascript
+ *
+ * [66] 加一
+ */
+
+// @lc code=start
+/**
+ * @param {number[]} digits
+ * @return {number[]}
+ */
+//   [7,8,9] [7,9,0]
+var plusOne = function (digits) {
+    for (var i = digits.length - 1; i >= 0; i--) {
+        digits[i]++;
+        if (digits[i] > 9) {
+            digits[i] = 0;
+        } else {
+            return digits;
+        }
+    }
+    digits.unshift(1);
+    return digits;
+};
+// @lc code=end
+

67.二进制求和.js

@@ -0,0 +1,20 @@
+/*
+ * @lc app=leetcode.cn id=67 lang=javascript
+ *
+ * [67] 二进制求和
+ */
+
+// @lc code=start
+/**
+ * @param {string} a
+ * @param {string} b
+ * @return {string}
+ */
+var addBinary = function(a, b) {
+    const aBin = `0b${a}`
+    const bBin = `0b${b}`
+    const sum = BigInt(aBin) + BigInt(bBin)
+    return sum.toString(2)
+};
+// @lc code=end
+

69.x-的平方根.js

@@ -0,0 +1,32 @@
+/*
+ * @lc app=leetcode.cn id=69 lang=javascript
+ *
+ * [69] x 的平方根
+ */
+
+// @lc code=start
+/**
+ * @param {number} x
+ * @return {number}
+ */
+var mySqrt = function(x) {
+    var left = 1;
+    var right = Math.floor(x / 2) + 1;
+    var mid;
+  
+    while (left <= right) {
+      mid = Math.floor((left + right) / 2);
+  
+      if (mid * mid > x) {
+        right = mid - 1;
+      } else if (mid * mid < x) {
+        left = mid + 1;
+      } else {
+        return mid;
+      }
+    }
+  
+    return right;
+};
+// @lc code=end
+

70.爬楼梯.js

@@ -45,7 +45,16 @@
  * @return {number}
  */
 var climbStairs = function(n) {
+    let prev = 0;
+    let cur = 1;
+    let temp;
 
+    for (let i = 0; i < n; i++) {
+        temp = prev;
+        prev = cur;
+        cur += temp; 
+    }
+    return cur;
 };
 // @lc code=end
 

83.删除排序链表中的重复元素.js

@@ -0,0 +1,32 @@
+/*
+ * @lc app=leetcode.cn id=83 lang=javascript
+ *
+ * [83] 删除排序链表中的重复元素
+ */
+
+// @lc code=start
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val) {
+ *     this.val = val;
+ *     this.next = null;
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var deleteDuplicates = function(head) {
+    var current = head
+    while(current) {
+        if(current.next !== null && current.val == current.next.val) {
+            current.next = current.next.next;
+        } else {
+            current = current.next;
+        }
+    }
+    
+    return head;
+};
+// @lc code=end
+

88.合并两个有序数组.js

@@ -0,0 +1,23 @@
+/*
+ * @lc app=leetcode.cn id=88 lang=javascript
+ *
+ * [88] 合并两个有序数组
+ */
+
+// @lc code=start
+/**
+ * @param {number[]} nums1
+ * @param {number} m
+ * @param {number[]} nums2
+ * @param {number} n
+ * @return {void} Do not return anything, modify nums1 in-place instead.
+ */
+var merge = function(nums1, m, nums2, n) {
+    var insertPos = m + n - 1;
+    m--; n--;
+    while (n >= 0) {
+        nums1[insertPos--] = (nums1[m] > nums2[n]) ? nums1[m--] : nums2[n--];
+    }
+};
+// @lc code=end
+