feat: 更新三道候选题目

Author: luzhipeng

134.gas-station.js

@@ -41,7 +41,7 @@ var canCompleteCircuit = function(gas, cost) {
 
   for(let i = 0; i < n; i++) {
     total += gas[i];
-    total -= cost[i]
+    total -= cost[i];
 
     remain += gas[i];
     remain -= cost[i];

448.find-all-numbers-disappeared-in-an-array.js

@@ -0,0 +1,27 @@
+/*
+ * @lc app=leetcode id=448 lang=javascript
+ *
+ * [448] Find All Numbers Disappeared in an Array
+ */
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var findDisappearedNumbers = function(nums) {
+    const res = [];
+    let cur = 0;
+    for(let i = 0; i < nums.length; i++) {
+        res[nums[i]] = true;
+    }
+
+    for(let i = 0; i < nums.length; i++) {
+        if (res[i + 1] === void 0) {
+            res[cur++] = i + 1;
+        }
+    }
+
+    res.length = cur;
+
+    return res;
+};
+

739.daily-temperatures.js

@@ -0,0 +1,42 @@
+/*
+ * @lc app=leetcode id=739 lang=javascript
+ *
+ * [739] Daily Temperatures
+ */
+/**
+ * @param {number[]} T
+ * @return {number[]}
+ */
+var dailyTemperatures = function(T) {
+  // // 暴力  时间复杂度O(n^2), 空间复杂度O(1)
+  // const res = [];
+  // for(let i = 0; i < T.length; i++) {
+  //     res[i] = 0;
+  //     for(let j = i; j < T.length; j++) {
+  //         if (T[j] > T[i]) {
+  //             res[i] = j - i;
+  //             break;
+  //         }
+  //     }
+  // }
+
+  // return res;
+
+  // 递增栈/递减栈
+  // 这里我们需要用到递减栈
+  // 时间复杂度O(n), 空间复杂度O(n)
+  // 典型的空间换时间
+  const stack = [];
+  const res = [];
+
+  for (let i = 0; i < T.length; i++) {
+    res[i] = 0;
+    while (stack.length !== 0 && T[i] > T[stack[stack.length - 1]]) {
+      const peek = stack.pop();
+      res[peek] = i - peek;
+    }
+    stack.push(i);
+  }
+
+  return res;
+};