汉化

Author: diguage

Diff for: logbook/202503.adoc

@@ -136,17 +136,17 @@ endif::[]
 |✅ 并查集，竟然一次通过
 
 |{counter:codes2503}
-|{leetcode_base_url}/3sum/[15. 3Sum^]
+|{leetcode_base_url}/3sum/[15. 三数之和^]
 |{doc_base_url}/0015-3sum.adoc[题解]
 |✅ 利用递归“降维”
 
 |{counter:codes2503}
-|{leetcode_base_url}/course-schedule/[207. Course Schedule^]
+|{leetcode_base_url}/course-schedule/[207. 课程表^]
 |{doc_base_url}/0207-course-schedule.adoc[题解]
 |✅ 拓扑排序
 
 |{counter:codes}
-|{leetcode_base_url}/maximum-subarray/[53. Maximum Subarray^]
+|{leetcode_base_url}/maximum-subarray/[53. 最大子数组和^]
 |{doc_base_url}/0053-maximum-subarray.adoc[题解]
 |⭕️ 动态规划。稀里糊涂就对了，还要对推演。另有更精妙的分治解法，抽空再尝试。