From 10d9fc8c960eb3de441c9d46ea63a77d088c9426 Mon Sep 17 00:00:00 2001 From: asskicker0214 Date: Sun, 11 May 2025 11:19:15 +0800 Subject: [PATCH 1/3] vault backup: 2025-05-11 11:19:15 --- 算法训练/刷题笔记/迭代一.md | 1 + 1 file changed, 1 insertion(+) diff --git a/算法训练/刷题笔记/迭代一.md b/算法训练/刷题笔记/迭代一.md index e67c061..10d87d9 100644 --- a/算法训练/刷题笔记/迭代一.md +++ b/算法训练/刷题笔记/迭代一.md @@ -16,6 +16,7 @@ - [ ] [110. 平衡二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/balanced-binary-tree/solutions/377216/ping-heng-er-cha-shu-by-leetcode-solution/) - [ ] [106. 从中序与后序遍历序列构造二叉树 - 力扣（LeetCode）](https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) - [ ] [501. 二叉搜索树中的众数 - 力扣（LeetCode）](https://leetcode.cn/problems/find-mode-in-binary-search-tree/) +- [ ] [450. 删除二叉搜索树中的节点 - 力扣（LeetCode）](https://leetcode.cn/problems/delete-node-in-a-bst/) From ea6d40dbf7c36768a0bf07c318542df060308ab4 Mon Sep 17 00:00:00 2001 From: asskicker0214 Date: Wed, 14 May 2025 22:16:19 +0800 Subject: [PATCH 2/3] vault backup: 2025-05-14 22:16:19 --- 算法训练/刷题笔记/迭代一.md | 1 + 1 file changed, 1 insertion(+) diff --git a/算法训练/刷题笔记/迭代一.md b/算法训练/刷题笔记/迭代一.md index c110be4..340d15c 100644 --- a/算法训练/刷题笔记/迭代一.md +++ b/算法训练/刷题笔记/迭代一.md @@ -20,6 +20,7 @@ - [ ] [40. 组合总和 II - 力扣（LeetCode）](https://leetcode.cn/problems/combination-sum-ii/) 重点是结果去重，技巧 1. 先对 candidates 排序，这样就不会出现 `[[1,2,5], [1,5,2]]` 的情况 2. 在每一个 epoch 中，循环时跳过 visited 元素，这样就不会出现 `[[1,2,5], [1,2,5]]` 的情况 +- [ ] [51. N 皇后 - 力扣（LeetCode）](https://leetcode.cn/problems/n-queens/description/) 按行回溯，很经典 From 4dd66309fd7712f8af02b1d23fca4c8d4b50b853 Mon Sep 17 00:00:00 2001 From: asskicker0214 Date: Thu, 15 May 2025 23:46:39 +0800 Subject: [PATCH 3/3] vault backup: 2025-05-15 23:46:39 --- 算法训练/刷题笔记/迭代一.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/算法训练/刷题笔记/迭代一.md b/算法训练/刷题笔记/迭代一.md index 340d15c..b4f7542 100644 --- a/算法训练/刷题笔记/迭代一.md +++ b/算法训练/刷题笔记/迭代一.md @@ -21,6 +21,8 @@ 1. 先对 candidates 排序，这样就不会出现 `[[1,2,5], [1,5,2]]` 的情况 2. 在每一个 epoch 中，循环时跳过 visited 元素，这样就不会出现 `[[1,2,5], [1,2,5]]` 的情况 - [ ] [51. N 皇后 - 力扣（LeetCode）](https://leetcode.cn/problems/n-queens/description/) 按行回溯，很经典 +- [ ] [455. 分发饼干 - 力扣（LeetCode）](https://leetcode.cn/problems/assign-cookies/) +- [ ] [376. 摆动序列 - 力扣（LeetCode）](https://leetcode.cn/problems/wiggle-subsequence/)