Merge branch 'main' of github.com:w2xi/leetcode

Author: w2xi

README.md

@@ -43,6 +43,7 @@
 |53|[最大子数组和](https://leetcode.cn/problems/maximum-subarray/)|[JavaScript](./algorithms/maximum-subarray.js)|Easy|
 |54|[螺旋矩阵](https://leetcode.cn/problems/spiral-matrix/)|[JavaScript](./algorithms/spiral-matrix.js)|Medium|
 |55|[跳跃游戏](https://leetcode.cn/problems/jump-game/)|[JavaScript](./algorithms/jump-game.js)|Medium|
+|56|[合并区间](https://leetcode.cn/problems/merge-intervals/)|[JavaScript](./algorithms/merge-intervals.js)|Medium|
 |58|[最后一个单词的长度](https://leetcode.cn/problems/length-of-last-word/)|[JavaScript](./algorithms/length-of-last-word.js)|Easy|
 |59|[螺旋矩阵 II](https://leetcode.cn/problems/spiral-matrix-ii/)|[JavaScript](./algorithms/spiral-matrix-ii.js)|Medium|
 |66|[加一](https://leetcode-cn.com/problems/plus-one/)|[JavaScript](./algorithms/plus-one.js)|Easy|
@@ -138,13 +139,15 @@
 |409|[最长回文串](https://leetcode.cn/problems/longest-palindrome/)|[JavaScript](./algorithms/longest-palindrome.js)|Easy|
 |412|[Fizz Buzz](https://leetcode.cn/problems/fizz-buzz/)|[JavaScript](./algorithms/fizz-buzz.js)|Easy|
 |414|[第三大的数](https://leetcode.cn/problems/third-maximum-number/)|[JavaScript](./algorithms/third-maximum-number.js)|Easy|
-|442|[数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/)|[JavaScript](./algorithms/find-all-duplicates-in-an-array.js)|Medium|
 |429|[N 叉树的层序遍历](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/)|[JavaScript](./algorithms/n-ary-tree-level-order-traversal.js)|Medium|
 |434|[字符串中的单词数](https://leetcode.cn/problems/number-of-segments-in-a-string/)|[JavaScript](./algorithms/number-of-segments-in-a-string.js)|Easy|
+|435|[无重叠区间](https://leetcode.cn/problems/non-overlapping-intervals/)|[JavaScript](./algorithms/non-overlapping-intervals.js)|Medium|
 |437|[路径总和 III](https://leetcode.cn/problems/path-sum-iii/)|[JavaScript](./algorithms/path-sum-iii.js)|Medium|
+|442|[数组中重复的数据](https://leetcode.cn/problems/find-all-duplicates-in-an-array/)|[JavaScript](./algorithms/find-all-duplicates-in-an-array.js)|Medium|
 |448|[找到所有数组中消失的数字](https://leetcode.cn/problems/find-all-numbers-disappeared-in-an-array/)|[JavaScript](./algorithms/find-all-numbers-disappeared-in-an-array.js)|Easy|
 |450|[删除二叉搜索树中的节点](https://leetcode.cn/problems/delete-node-in-a-bst/)|[JavaScript](./algorithms/delete-node-in-a-bst.js)|Medium|
 |451|[根据字符出现频率排序](https://leetcode.cn/problems/sort-characters-by-frequency/)|[JavaScript](./algorithms/sort-characters-by-frequency.js)|Medium|
+|452|[用最少数量的箭引爆气球](https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/)|[JavaScript](./algorithms/minimum-number-of-arrows-to-burst-balloons.js)|Medium|
 |453|[最小操作次数使数组元素相等](https://leetcode.cn/problems/minimum-moves-to-equal-array-elements/)|[JavaScript](./algorithms/minimum-moves-to-equal-array-elements.js)|Easy|
 |454|[四数相加 II](https://leetcode.cn/problems/4sum-ii/)|[JavaScript](./algorithms/4sum-ii.js)|Medium|
 |455|[分发饼干](https://leetcode.cn/problems/assign-cookies/)|[JavaScript](./algorithms/assign-cookies.js)|Easy|
@@ -154,6 +157,7 @@
 |498|[对角线遍历](https://leetcode.cn/problems/diagonal-traverse/)|[JavaScript](./algorithms/diagonal-traverse.js)|Medium|
 |501|[二叉搜索树中的众数](https://leetcode.cn/problems/find-mode-in-binary-search-tree/)|[JavaScript](./algorithms/find-mode-in-binary-search-tree.js)|Easy|
 |506|[相对名次](https://leetcode.cn/problems/relative-ranks/)|[JavaScript](./algorithms/relative-ranks.js)|Easy|
+|508|[出现次数最多的子树元素和](https://leetcode.cn/problems/most-frequent-subtree-sum/)|[JavaScript](./algorithms/most-frequent-subtree-sum.js)|Medium|
 |509|[斐波那契数](https://leetcode.cn/problems/fibonacci-number/)|[JavaScript](./algorithms/fibonacci-number.js)|Easy|
 |513|[找树左下角的值](https://leetcode.cn/problems/find-bottom-left-tree-value/)|[JavaScript](./algorithms/find-bottom-left-tree-value.js)|Medium|
 |515|[在每个树行中找最大值](https://leetcode.cn/problems/find-largest-value-in-each-tree-row/)|[JavaScript](./algorithms/find-largest-value-in-each-tree-row.js)|Medium|
@@ -188,6 +192,9 @@
 |701|[二叉搜索树中的插入操作](https://leetcode.cn/problems/insert-into-a-binary-search-tree/)|[JavaScript](./algorithms/insert-into-a-binary-search-tree.js)|Medium|
 |704|[二分查找](https://leetcode.cn/problems/binary-search/)|[JavaScript](./algorithms/binary-search.js)|Easy|
 |707|[设计链表](https://leetcode.cn/problems/design-linked-list/)|[JavaScript](./algorithms/design-linked-list.js)|Medium|
+|714|[买卖股票的最佳时机含手续费](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)|[JavaScript](./algorithms/best-time-to-buy-and-sell-stock-with-transaction-fee.js)|Medium|
+|738|[单调递增的数字](https://leetcode.cn/problems/monotone-increasing-digits/)|[JavaScript](./algorithms/monotone-increasing-digits.js)|Medium|
+|763|[划分字母区间](https://leetcode.cn/problems/partition-labels/)|[JavaScript](./algorithms/partition-labels.js)|Medium|
 |844|[比较含退格的字符串](https://leetcode.cn/problems/backspace-string-compare/)|[JavaScript](./algorithms/backspace-string-compare.js)|Easy|
 |860|[柠檬水找零](https://leetcode.cn/problems/lemonade-change/)|[JavaScript](./algorithms/lemonade-change.js)|Easy|
 |876|[链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/)|[JavaScript](./algorithms/middle-of-the-linked-list.js)|Easy|
@@ -231,6 +238,7 @@
 |2341|[数组能形成多少数对](https://leetcode.cn/problems/maximum-number-of-pairs-in-array/)|[JavaScript](./algorithms/maximum-number-of-pairs-in-array.js)|Easy|
 |2351|[第一个出现两次的字母](https://leetcode.cn/problems/first-letter-to-appear-twice/)|[JavaScript](./algorithms/first-letter-to-appear-twice.js)|Easy|
 |6354|[找出数组的串联值](https://leetcode.cn/problems/find-the-array-concatenation-value/)|[JavaScript](./algorithms/find-the-array-concatenation-value.js)|Easy|
+|6362|[合并两个二维数组 - 求和法](https://leetcode.cn/problems/merge-two-2d-arrays-by-summing-values/)|[JavaScript]()|Easy|
 |面试题 04.12|[面试题 04.12. 求和路径](https://leetcode.cn/problems/paths-with-sum-lcci/)|[JavaScript](./algorithms/paths-with-sum-lcci.js)|Medium|
 |面试题 02.07|[面试题 02.07. 链表相交](https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/)|[JavaScript](./algorithms/intersection-of-two-linked-lists-lcci.js)|Easy|
 |剑指 Offer 05. 替换空格|[剑指 Offer 05. 替换空格](https://leetcode.cn/problems/ti-huan-kong-ge-lcof/)|[JavaScript](./algorithms/ti-huan-kong-ge-lcof.js)|Easy|

algorithms/best-time-to-buy-and-sell-stock-with-transaction-fee.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} prices
+ * @param {number} fee
+ * @return {number}
+ */
+var maxProfit = function (prices, fee) {
+  let minPrice = prices[0];
+  let result = 0;
+
+  for (let i = 1; i < prices.length; i++) {
+    const curr = prices[i];
+    if (minPrice > curr) {
+      minPrice = curr;
+    }
+    if (curr - minPrice > fee) {
+      result += curr - minPrice - fee;
+      minPrice = curr - fee;
+    }
+  }
+
+  return result;
+};

algorithms/merge-intervals.js

@@ -0,0 +1,26 @@
+/**
+ * 56. 合并区间
+ * @param {number[][]} intervals
+ * @return {number[][]}
+ */
+var merge = function (intervals) {
+  if (intervals.length === 1) {
+    return intervals;
+  }
+  const result = [];
+  intervals.sort((a, b) => a[0] - b[0]);
+
+  for (let i = 1; i < intervals.length; i++) {
+    if (intervals[i][0] <= intervals[i - 1][1]) {
+      // 重叠
+      intervals[i][1] = Math.max(intervals[i][1], intervals[i - 1][1]);
+      intervals[i][0] = intervals[i - 1][0];
+    } else {
+      result.push(intervals[i - 1]);
+    }
+  }
+
+  result.push(intervals[intervals.length - 1]); // 总是 push 最后一个元素
+
+  return result;
+};

algorithms/merge-two-2d-arrays-by-summing-values.js

@@ -0,0 +1,39 @@
+/**
+ * @param {number[][]} nums1
+ * @param {number[][]} nums2
+ * @return {number[][]}
+ */
+var mergeArrays = function (nums1, nums2) {
+  let left1 = 0;
+  let right1 = nums1.length - 1;
+  let left2 = 0;
+  let right2 = nums2.length - 1;
+
+  const result = [];
+
+  // 思路和合并两个有序数组一样
+
+  while (left1 <= right1 && left2 <= right2) {
+    const curr1 = nums1[left1];
+    const curr2 = nums2[left2];
+
+    if (curr1[0] < curr2[0]) {
+      result.push(curr1);
+      left1++;
+    } else if (curr1[0] > curr2[0]) {
+      result.push(curr2);
+      left2++;
+    } else {
+      result.push([curr1[0], curr1[1] + curr2[1]]);
+      left1++;
+      left2++;
+    }
+  }
+  if (left1 > right1) {
+    result.push(...nums2.slice(left2));
+  } else {
+    result.push(...nums1.slice(left1));
+  }
+
+  return result;
+};

algorithms/minimum-number-of-arrows-to-burst-balloons.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[][]} points
+ * @return {number}
+ */
+var findMinArrowShots = function (points) {
+  points.sort((a, b) => a[0] - b[0]);
+
+  let result = 1; // points 为空至少需要一只箭
+
+  for (let i = 1; i < points.length; i++) {
+    if (points[i][0] <= points[i - 1][1]) {
+      // 更新重叠气球最小右边界
+      points[i][1] = Math.min(points[i][1], points[i - 1][1]);
+    } else {
+      result++;
+    }
+  }
+
+  return result;
+};

algorithms/monotone-increasing-digits.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var monotoneIncreasingDigits = function (n) {
+  let s = String(n);
+  let end = s.length - 1;
+  let temp = 0;
+
+  for (let i = end; i > 0; i--) {
+    if (s[i] < s[i - 1]) {
+      temp = +s.slice(i) + 1;
+      s = String(s - temp);
+    }
+  }
+  return +s;
+};
+
+var monotoneIncreasingDigits = function (n) {
+  const arr = String(n).split("");
+  let index = arr.length;
+
+  for (let i = arr.length - 1; i > 0; i--) {
+    if (arr[i] < arr[i - 1]) {
+      index = i;
+      arr[i - 1]--;
+    }
+  }
+  for (let i = index; i < arr.length; i++) {
+    arr[i] = "9";
+  }
+  return +arr.join("");
+};

algorithms/most-frequent-subtree-sum.js

@@ -0,0 +1,39 @@
+/**
+ * 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)
+ * }
+ */
+/**
+ * 508. 出现次数最多的子树元素和
+ * @param {TreeNode} root
+ * @return {number[]}
+ */
+var findFrequentTreeSum = function (root) {
+  const map = new Map();
+  const result = [];
+  let maxCount = 0; // 最大出现次数
+
+  const dfs = (root) => {
+    if (!root) return 0;
+    const left = dfs(root.left);
+    const right = dfs(root.right);
+    const val = left + right + root.val;
+
+    map.set(val, (map.get(val) || 0) + 1); // 记录次数
+    maxCount = Math.max(maxCount, map.get(val));
+
+    return val;
+  };
+  dfs(root);
+
+  map.forEach((count, val) => {
+    if (count === maxCount) {
+      result.push(val);
+    }
+  });
+
+  return result;
+};

algorithms/non-overlapping-intervals.js

@@ -0,0 +1,19 @@
+/**
+ * 435. 无重叠区间
+ * @param {number[][]} intervals
+ * @return {number}
+ */
+var eraseOverlapIntervals = function (intervals) {
+  if (intervals.length === 1) return 0;
+  let result = 0;
+  intervals.sort((a, b) => a[0] - b[0]);
+
+  for (let i = 1; i < intervals.length; i++) {
+    if (intervals[i][0] < intervals[i - 1][1]) {
+      intervals[i][1] = Math.min(intervals[i - 1][1], intervals[i][1]);
+      result++;
+    }
+  }
+
+  return result;
+};

algorithms/partition-labels.js

@@ -0,0 +1,28 @@
+/**
+ * 763. 划分字母区间
+ * @param {string} s
+ * @return {number[]}
+ */
+var partitionLabels = function (s) {
+  const map = Array(26).fill(0);
+  const result = [];
+  let start = 0; // 片段的起始位置
+  let end = 0; // 片段的结束位置
+
+  for (let i = 0; i < s.length; i++) {
+    const index = s[i].charCodeAt() - 97;
+    map[index] = i; // 记录字符最后出现的索引位置
+  }
+  for (let i = 0; i < s.length; i++) {
+    const index = s[i].charCodeAt() - 97;
+    end = Math.max(end, map[index]);
+
+    if (end === i) {
+      // 说明后面的片段没有出现重复的字母了
+      result.push(end - start + 1);
+      start = end + 1; // 更新起始位置
+    }
+  }
+
+  return result;
+};