update

woaihekele · Jan 1, 2021 · e3b26ae · e3b26ae
1 parent aed52e6
commit e3b26ae
Show file tree

Hide file tree

Showing 12 changed files with 13 additions and 13 deletions.
diff --git a/html/blogs.html b/html/blogs.html
@@ -1374,17 +1374,17 @@ <h3 id="sec-2-7"><span class="section-number-3">2.7</span> leetcode</h3>
 </li>
 <li><a href="lc-1621-number-of-sets-of-k-non-overlapping-line-segments.html">LC 1621. 大小为 K 的不重叠线段的数目</a>
 </li>
-<li><a href="lc-5128-graph-connectivity-with-threshold.html">LC 5128. 带阈值的图连通性</a> 多重连通性和Find/Union
+<li><a href="lc-1627-graph-connectivity-with-threshold.html">LC 5128. 带阈值的图连通性</a> 多重连通性和Find/Union
 </li>
-<li><a href="lc-5545-best-team-with-no-conflicts.html">LC 5545. 无矛盾的最佳球队</a> 从计算顺序性到动态规划
+<li><a href="lc-1626-best-team-with-no-conflicts.html">LC 5545. 无矛盾的最佳球队</a> 从计算顺序性到动态规划
 </li>
 <li><a href="lc-1585-check-if-string-is-transformable-with-substring-sort-operations.html">LC 1585. 检查字符串是否可以通过排序子字符串得到另一个字符串</a>
 </li>
 <li><a href="lc-1605-find-valid-matrix-given-row-and-column-sums.html">LC 1605. 给定行和列的和求可行矩阵</a>
 </li>
 <li><a href="lc-1595-minimum-cost-to-connect-two-groups-of-points.html">LC 1595. 连通两组点的最小成本</a> 两个状态变量的动态规划
 </li>
-<li><a href="lc-5497-find-latest-group-of-size-m.html">LC 5497. 查找大小为 M 的最新分组</a> 是否应该维护两个Find/Union数据结构？？
+<li><a href="lc-1562-find-latest-group-of-size-m.html">LC 5497. 查找大小为 M 的最新分组</a> 是否应该维护两个Find/Union数据结构？？
 </li>
 <li><a href="lc-1520-maximum-number-of-non-overlapping-substrings.html">LC 1520. 最多的不重叠子字符串</a> 区间扩展 + 贪心算法选择最优区间
 </li>
@@ -1418,11 +1418,11 @@ <h3 id="sec-2-7"><span class="section-number-3">2.7</span> leetcode</h3>
 </li>
 <li><a href="cf-1359c-mixing-water.html">CF 1359C. Mixing Water</a> 基本的数学推导
 </li>
-<li><a href="lc-lcp-14-qie-fen-shu-zu.html">LCP 14. 切分数组</a> 因数分解和另外一种状态方程
+<li><a href="lcp-14-qie-fen-shu-zu.html">LCP 14. 切分数组</a> 因数分解和另外一种状态方程
 </li>
 <li><a href="lc-find-the-shortest-superstring.html">LC 943. Find the Shortest Superstring</a> 状态压缩DP和全排列之间的关系
 </li>
-<li><a href="lc-lcp-13-xun-bao.html">LCP 13. 寻宝</a> 状态压缩DP和全排列之间的关系
+<li><a href="lcp-13-xun-bao.html">LCP 13. 寻宝</a> 状态压缩DP和全排列之间的关系
 </li>
 <li><a href="lc-517-super-washing-machines.html">LC 517. Super Washing Machines</a> 奇怪的贪心算法 + 直觉的重要性
 </li>

diff --git a/.../lc-5497-find-latest-group-of-size-m.html → .../lc-1562-find-latest-group-of-size-m.html b/.../lc-5497-find-latest-group-of-size-m.html → .../lc-1562-find-latest-group-of-size-m.html
diff --git a/.../lc-5545-best-team-with-no-conflicts.html → .../lc-1626-best-team-with-no-conflicts.html b/.../lc-5545-best-team-with-no-conflicts.html → .../lc-1626-best-team-with-no-conflicts.html
diff --git a/...28-graph-connectivity-with-threshold.html → ...27-graph-connectivity-with-threshold.html b/...28-graph-connectivity-with-threshold.html → ...27-graph-connectivity-with-threshold.html
diff --git a/html/lc-lcp-13-xun-bao.html → html/lcp-13-xun-bao.html b/html/lc-lcp-13-xun-bao.html → html/lcp-13-xun-bao.html
diff --git a/html/lc-lcp-14-qie-fen-shu-zu.html → html/lcp-14-qie-fen-shu-zu.html b/html/lc-lcp-14-qie-fen-shu-zu.html → html/lcp-14-qie-fen-shu-zu.html
diff --git a/src/blogs.org b/src/blogs.org
@@ -638,12 +638,12 @@
 - [[file:lc-1655-distribute-repeating-integers.org][LC 1655. 分配重复整数]] 装箱问题和动态规划
 - [[file:lc-1622-fancy-sequence.org][LC 1622. 奇妙序列]] 支持计算组合的日志
 - [[file:lc-1621-number-of-sets-of-k-non-overlapping-line-segments.org][LC 1621. 大小为 K 的不重叠线段的数目]]
-- [[file:lc-5128-graph-connectivity-with-threshold.org][LC 5128. 带阈值的图连通性]] 多重连通性和Find/Union
-- [[file:lc-5545-best-team-with-no-conflicts.org][LC 5545. 无矛盾的最佳球队]] 从计算顺序性到动态规划
+- [[file:lc-1627-graph-connectivity-with-threshold.org][LC 1627. 带阈值的图连通性]] 多重连通性和Find/Union
+- [[file:lc-1626-best-team-with-no-conflicts.org][LC 1626. 无矛盾的最佳球队]] 从计算顺序性到动态规划
 - [[file:lc-1585-check-if-string-is-transformable-with-substring-sort-operations.org][LC 1585. 检查字符串是否可以通过排序子字符串得到另一个字符串]]
 - [[file:lc-1605-find-valid-matrix-given-row-and-column-sums.org][LC 1605. 给定行和列的和求可行矩阵]]
 - [[file:lc-1595-minimum-cost-to-connect-two-groups-of-points.org][LC 1595. 连通两组点的最小成本]] 两个状态变量的动态规划
-- [[file:lc-5497-find-latest-group-of-size-m.org][LC 5497. 查找大小为 M 的最新分组]] 是否应该维护两个Find/Union数据结构？？
+- [[file:lc-1562-find-latest-group-of-size-m.org][LC 1562. 查找大小为 M 的最新分组]] 是否应该维护两个Find/Union数据结构？？
 - [[file:lc-1520-maximum-number-of-non-overlapping-substrings.org][LC 1520. 最多的不重叠子字符串]] 区间扩展 + 贪心算法选择最优区间
 - [[file:lc-1521-find-a-value-of-a-mysterious-function-closest-to-target.org][LC 1521. 找到最接近目标值的函数值]] 快速重建区间元素AND的结果
 - [[file:lc-1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.org][LC 1526. 形成目标数组的子数组最少增加次数]] 简化区间操作代价和差分数组的应用
@@ -660,9 +660,9 @@
 - [[file:lc-889-orderly-queue.org][LC 899. 有序队列]] 数学变换/满足某种条件的操作可以推导出任意操作
 - [[file:cf-1359d-yet-another-yet-another-task.org][CF 1359D. Yet Another Yet Another Task]] 寻找替代值，最大子序列之和扩展
 - [[file:cf-1359c-mixing-water.org][CF 1359C. Mixing Water]] 基本的数学推导
-- [[file:lc-lcp-14-qie-fen-shu-zu.org][LCP 14. 切分数组]] 因数分解和另外一种状态方程
+- [[file:lcp-14-qie-fen-shu-zu.org][LCP 14. 切分数组]] 因数分解和另外一种状态方程
 - [[file:lc-find-the-shortest-superstring.org][LC 943. Find the Shortest Superstring]] 状态压缩DP和全排列之间的关系
-- [[file:lc-lcp-13-xun-bao.org][LCP 13. 寻宝]] 状态压缩DP和全排列之间的关系
+- [[file:lcp-13-xun-bao.org][LCP 13. 寻宝]] 状态压缩DP和全排列之间的关系
 - [[file:lc-517-super-washing-machines.org][LC 517. Super Washing Machines]] 奇怪的贪心算法 + 直觉的重要性
 - [[file:lc-1371-find-the-longest-substring-containing-vowels-in-even-counts.org][LC 1371. Find the Longest Substring Containing Vowels in Even Counts]] 偶数个字符的最大串
 - [[file:lc-1453-maximum-number-of-darts-inside-of-a-circular-dartboard.org][LC 1453. Maximum Number of Darts Inside of a Circular Dartboard]] 半径为r的圆最多可以围住多少个点

diff --git a/src/lc-5497-find-latest-group-of-size-m.org → src/lc-1562-find-latest-group-of-size-m.org b/src/lc-5497-find-latest-group-of-size-m.org → src/lc-1562-find-latest-group-of-size-m.org
@@ -1,4 +1,4 @@
-#+title: 5497. 查找大小为 M 的最新分组
+#+title: 1562. 查找大小为 M 的最新分组
 
 https://leetcode-cn.com/problems/find-latest-group-of-size-m/
 

diff --git a/src/lc-5545-best-team-with-no-conflicts.org → src/lc-1626-best-team-with-no-conflicts.org b/src/lc-5545-best-team-with-no-conflicts.org → src/lc-1626-best-team-with-no-conflicts.org
@@ -1,4 +1,4 @@
-#+title: 5545. 无矛盾的最佳球队
+#+title: 1626. 无矛盾的最佳球队
 
 https://leetcode-cn.com/problems/best-team-with-no-conflicts/
 

diff --git a/...128-graph-connectivity-with-threshold.org → ...627-graph-connectivity-with-threshold.org b/...128-graph-connectivity-with-threshold.org → ...627-graph-connectivity-with-threshold.org
@@ -1,4 +1,4 @@
-#+title: 5128. 带阈值的图连通性
+#+title: 1627. 带阈值的图连通性
 
 https://leetcode-cn.com/problems/graph-connectivity-with-threshold/
 

diff --git a/src/lc-lcp-13-xun-bao.org → src/lcp-13-xun-bao.org b/src/lc-lcp-13-xun-bao.org → src/lcp-13-xun-bao.org
diff --git a/src/lc-lcp-14-qie-fen-shu-zu.org → src/lcp-14-qie-fen-shu-zu.org b/src/lc-lcp-14-qie-fen-shu-zu.org → src/lcp-14-qie-fen-shu-zu.org