增加动态规划进阶题目列表

Author: diguage

docs/0000-26-dynamic-programming.adoc

@@ -82,7 +82,53 @@ https://leetcode.cn/studyplan/dynamic-programming/[动态规划（基础版）^]
 
 https://leetcode.cn/studyplan/dynamic-programming-grandmaster/[动态规划（进阶版）^]
 
-
+. xref:1048-longest-string-chain.adoc[1048. 最长字符串链]
+. xref:0376-wiggle-subsequence.adoc[376. 摆动序列]
+. xref:0651-4-keys-keyboard.adoc[651. 四个键的键盘]
+. xref:0032-longest-valid-parentheses.adoc[32. 最长有效括号]
+. xref:1416-restore-the-array.adoc[1416. 恢复数组]
+. xref:1259-handshakes-that-dont-cross.adoc[1259. 不相交的握手]
+. xref:0639-decode-ways-ii.adoc[639. 解码方法 II]
+. xref:1770-maximum-score-from-performing-multiplication-operations.adoc[1770. 执行乘法运算的最大分数]
+. xref:1463-cherry-pickup-ii.adoc[1463. 摘樱桃 II]
+. xref:1473-paint-house-iii.adoc[1473. 粉刷房子 III]
+. xref:0403-frog-jump.adoc[403. 青蛙过河]
+. xref:1335-minimum-difficulty-of-a-job-schedule.adoc[1335. 工作计划的最低难度]
+. xref:0664-strange-printer.adoc[664. 奇怪的打印机]
+. xref:1547-minimum-cost-to-cut-a-stick.adoc[1547. 切棍子的最小成本]
+. xref:1575-count-all-possible-routes.adoc[1575. 统计所有可行路径]
+. xref:1639-number-of-ways-to-form-a-target-string-given-a-dictionary.adoc[1639. 通过给定词典构造目标字符串的方案数]
+. xref:2328-number-of-increasing-paths-in-a-grid.adoc[2328. 网格图中递增路径的数目]
+. xref:0920-number-of-music-playlists.adoc[920. 播放列表的数量]
+. xref:1444-number-of-ways-of-cutting-a-pizza.adoc[1444. 切披萨的方案数]
+. xref:0087-scramble-string.adoc[87. 扰乱字符串]
+. xref:1230-toss-strange-coins.adoc[1230. 抛掷硬币]
+. xref:0688-knight-probability-in-chessboard.adoc[688. 骑士在棋盘上的概率]
+. xref:0808-soup-servings.adoc[808. 分汤]
+. xref:0837-new-21-game.adoc[837. 新 21 点]
+. xref:1601-maximum-number-of-achievable-transfer-requests.adoc[1601. 最多可达成的换楼请求数目]
+. xref:1626-best-team-with-no-conflicts.adoc[1626. 无矛盾的最佳球队]
+. xref:0879-profitable-schemes.adoc[879. 盈利计划]
+. xref:0956-tallest-billboard.adoc[956. 最高的广告牌]
+. xref:0894-all-possible-full-binary-trees.adoc[894. 所有可能的真二叉树]
+. xref:1339-maximum-product-of-splitted-binary-tree.adoc[1339. 分裂二叉树的最大乘积]
+. xref:0968-binary-tree-cameras.adoc[968. 监控二叉树]
+. xref:1569-number-of-ways-to-reorder-array-to-get-same-bst.adoc[1569. 将子数组重新排序得到同一个二叉搜索树的方案数]
+. xref:0698-partition-to-k-equal-sum-subsets.adoc[698. 划分为k个相等的子集]
+. xref:0465-optimal-account-balancing.adoc[465. 最优账单平衡]
+. xref:0847-shortest-path-visiting-all-nodes.adoc[847. 访问所有节点的最短路径]
+. xref:1125-smallest-sufficient-team.adoc[1125. 最小的必要团队]
+. xref:1434-number-of-ways-to-wear-different-hats-to-each-other.adoc[1434. 每个人戴不同帽子的方案数]
+. xref:1799-maximize-score-after-n-operations.adoc[1799. N 次操作后的最大分数和]
+. xref:0877-stone-game.adoc[877. 石子游戏]
+. xref:0486-predict-the-winner.adoc[486. 预测赢家]
+. xref:1510-stone-game-iv.adoc[1510. 石子游戏 IV]
+. xref:1406-stone-game-iii.adoc[1406. 石子游戏 III]
+. xref:1140-stone-game-ii.adoc[1140. 石子游戏 II]
+. xref:1751-maximum-number-of-events-that-can-be-attended-ii.adoc[1751. 最多可以参加的会议数目 II]
+. xref:1235-maximum-profit-in-job-scheduling.adoc[1235. 规划兼职工作]
+. xref:0887-super-egg-drop.adoc[887. 鸡蛋掉落]
+. xref:1187-make-array-strictly-increasing.adoc[1187. 使数组严格递增]
 
 == 经典题目
 

tools/e-extra-problems.sh

@@ -0,0 +1,9 @@
+# 从截图提取文字，然后转换成题目列表
+
+for id in `cat /tmp/dp.txt | grep '#' | sed 's/[^0-9]//g'`; do
+  pid=$(printf %04d $id)
+  fileName=$(grep "$pid" docs/files.txt)
+  title=$(cat docs/$fileName | sed -n '2p' | sed 's/..//')
+#  echo $pid $title $fileName
+  echo ". xref:${fileName}[${title}]"
+done