From 4dd66309fd7712f8af02b1d23fca4c8d4b50b853 Mon Sep 17 00:00:00 2001 From: asskicker0214 Date: Thu, 15 May 2025 23:46:39 +0800 Subject: [PATCH] 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/)