InvolutionHell · karicms · Apr 9, 2026
diff --git a/...ommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.md b/...ommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.md
@@ -9,7 +9,7 @@ tags:
 docId: l6eepr5ctjgrhdgupy3twr1t
 ---
 
-# <https://arxiv.org/pdf/2512.14982>
+# &lt;https://arxiv.org/pdf/2512.14982&gt;
 
 When not using reasoning, repeating the input prompt improves performance for popular models (Gemini, GPT, Claude, and Deepseek) without increasing the number of generated tokens or latency.
 

diff --git a/...ommunityShare/Leetcode/1004_translated.md → ...docs/CommunityShare/Leetcode/1004-ones.md b/...ommunityShare/Leetcode/1004_translated.md → ...docs/CommunityShare/Leetcode/1004-ones.md
diff --git a/...are/Leetcode/[121]买卖股票的最佳时期_translated.md → ...docs/CommunityShare/Leetcode/121-stock.md b/...are/Leetcode/[121]买卖股票的最佳时期_translated.md → ...docs/CommunityShare/Leetcode/121-stock.md
diff --git a/.../Leetcode/1234. 替换子串得到平衡字符串_translated.md → ...s/CommunityShare/Leetcode/1234-replace.md b/.../Leetcode/1234. 替换子串得到平衡字符串_translated.md → ...s/CommunityShare/Leetcode/1234-replace.md
diff --git a/...yShare/Leetcode/[1333]餐厅过滤器_translated.md → ...cs/CommunityShare/Leetcode/1333-filter.md b/...yShare/Leetcode/[1333]餐厅过滤器_translated.md → ...cs/CommunityShare/Leetcode/1333-filter.md
diff --git a/...tyShare/Leetcode/142.环形链表II_translated.md → ...unityShare/Leetcode/142-linked-list-ii.md b/...tyShare/Leetcode/142.环形链表II_translated.md → ...unityShare/Leetcode/142-linked-list-ii.md
@@ -23,7 +23,7 @@ docId: ylpucy1rbbnfpe3t62u8kcfq
 [//]: #
 [//]: # "<p><strong>Exemplary example 1：</strong></p>"
 [//]: #
-[//]: # '<p><img src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png" /></p>'
+[//]: # '<p>&lt;img src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png" /&gt;</p>'
 [//]: #
 [//]: # "<pre>"
 [//]: # "<strong>enter：</strong>head = [3,2,0,-4], pos = 1"
@@ -33,7 +33,7 @@ docId: ylpucy1rbbnfpe3t62u8kcfq
 [//]: #
 [//]: # "<p><strong>Exemplary example 2：</strong></p>"
 [//]: #
-[//]: # '<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test2.png" /></p>'
+[//]: # '<p>&lt;img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test2.png" /&gt;</p>'
 [//]: #
 [//]: # "<pre>"
 [//]: # "<strong>enter：</strong>head = [1,2], pos = 0"
@@ -43,7 +43,7 @@ docId: ylpucy1rbbnfpe3t62u8kcfq
 [//]: #
 [//]: # "<p><strong>Exemplary example 3：</strong></p>"
 [//]: #
-[//]: # '<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test3.png" /></p>'
+[//]: # '<p>&lt;img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/07/circularlinkedlist_test3.png" /&gt;</p>'
 [//]: #
 [//]: # "<pre>"
 [//]: # "<strong>enter：</strong>head = [1], pos = -1"
@@ -57,7 +57,7 @@ docId: ylpucy1rbbnfpe3t62u8kcfq
 [//]: #
 [//]: # "<ul> "
 [//]: # " <li>Linked中节点的数目范围在范围 <code>[0, 10<sup>4</sup>]</code> Inside</li> "
-[//]: # " <li><code>-10<sup>5</sup> <= Node.val <= 10<sup>5</sup></code></li> "
+[//]: # " <li><code>-10<sup>5</sup> &lt;= Node.val &lt;= 10&lt;sup&gt;5</sup></code></li> "
 [//]: # " <li><code>pos</code> Value <code>-1</code> 或者Linked中的一indivualhave效索引</li> "
 [//]: # "</ul>"
 

diff --git a/...yShare/Leetcode/[146]LRU 缓存_translated.md → app/docs/CommunityShare/Leetcode/146-lru.md b/...yShare/Leetcode/[146]LRU 缓存_translated.md → app/docs/CommunityShare/Leetcode/146-lru.md
diff --git a/...re/Leetcode/[1545]找出第 N 个二进制字符串中的第 K 位.md → ...ommunityShare/Leetcode/1545-nth-binary.md b/...re/Leetcode/[1545]找出第 N 个二进制字符串中的第 K 位.md → ...ommunityShare/Leetcode/1545-nth-binary.md
diff --git a/...eetcode/1653. 使字符串平衡的最少删除次数_translated.md → ...unityShare/Leetcode/1653-min-deletions.md b/...eetcode/1653. 使字符串平衡的最少删除次数_translated.md → ...unityShare/Leetcode/1653-min-deletions.md
diff --git a/...are/Leetcode/1664生成平衡数组的方案数_translated.md → .../CommunityShare/Leetcode/1664-balanced.md b/...are/Leetcode/1664生成平衡数组的方案数_translated.md → .../CommunityShare/Leetcode/1664-balanced.md
diff --git a/...hare/Leetcode/1825求出 MK 平均值_translated.md → ...ommunityShare/Leetcode/1825-mk-average.md b/...hare/Leetcode/1825求出 MK 平均值_translated.md → ...ommunityShare/Leetcode/1825-mk-average.md
diff --git a/...are/Leetcode/1828统计一个圆中点的数目_translated.md → ...cs/CommunityShare/Leetcode/1828-points.md b/...are/Leetcode/1828统计一个圆中点的数目_translated.md → ...cs/CommunityShare/Leetcode/1828-points.md
diff --git a/...Share/Leetcode/[213]打家劫舍 II_translated.md → .../CommunityShare/Leetcode/213-robber-ii.md b/...Share/Leetcode/[213]打家劫舍 II_translated.md → .../CommunityShare/Leetcode/213-robber-ii.md
diff --git a/...tyShare/Leetcode/2131. 连接两字母单词得到的最长回文串.md → ...ommunityShare/Leetcode/2131-palindrome.md b/...tyShare/Leetcode/2131. 连接两字母单词得到的最长回文串.md → ...ommunityShare/Leetcode/2131-palindrome.md
diff --git a/...CommunityShare/Leetcode/219_translated.md → ...mmunityShare/Leetcode/219-duplicate-ii.md b/...CommunityShare/Leetcode/219_translated.md → ...mmunityShare/Leetcode/219-duplicate-ii.md
diff --git a/...e/Leetcode/2241. Design an ATM Machine.md → app/docs/CommunityShare/Leetcode/2241-atm.md b/...e/Leetcode/2241. Design an ATM Machine.md → app/docs/CommunityShare/Leetcode/2241-atm.md
diff --git a/...de/2270. Number of Ways to Split Array.md → ...mmunityShare/Leetcode/2270-split-array.md b/...de/2270. Number of Ways to Split Array.md → ...mmunityShare/Leetcode/2270-split-array.md
diff --git a/...ommunityShare/Leetcode/2293_translated.md → ...s/CommunityShare/Leetcode/2293-min-max.md b/...ommunityShare/Leetcode/2293_translated.md → ...s/CommunityShare/Leetcode/2293-min-max.md
diff --git a/...Share/Leetcode/2299强密码检验器II_translated.md → .../CommunityShare/Leetcode/2299-password.md b/...Share/Leetcode/2299强密码检验器II_translated.md → .../CommunityShare/Leetcode/2299-password.md
diff --git a/...e/Leetcode/2309兼具大小写的最好英文字母_translated.md → ...cs/CommunityShare/Leetcode/2309-letter.md b/...e/Leetcode/2309兼具大小写的最好英文字母_translated.md → ...cs/CommunityShare/Leetcode/2309-letter.md
diff --git a/...Leetcode/2335. 装满杯子需要的最短总时长_translated.md → ...e filled with a cup One question daily.md b/...Leetcode/2335. 装满杯子需要的最短总时长_translated.md → ...e filled with a cup One question daily.md
diff --git a/...re/Leetcode/2341. 数组能形成多少数对_translated.md → ...ocs/CommunityShare/Leetcode/2341-pairs.md b/...re/Leetcode/2341. 数组能形成多少数对_translated.md → ...ocs/CommunityShare/Leetcode/2341-pairs.md
diff --git a/...ityShare/Leetcode/[2490]回环句_translated.md → .../CommunityShare/Leetcode/2490-circular.md b/...ityShare/Leetcode/[2490]回环句_translated.md → .../CommunityShare/Leetcode/2490-circular.md
diff --git a/...are/Leetcode/[2562]找出数组的串联值_translated.md → ...cs/CommunityShare/Leetcode/2562-concat.md b/...are/Leetcode/[2562]找出数组的串联值_translated.md → ...cs/CommunityShare/Leetcode/2562-concat.md
diff --git a/...ityShare/Leetcode/[2582]递枕头_translated.md → ...cs/CommunityShare/Leetcode/2582-pillow.md b/...ityShare/Leetcode/[2582]递枕头_translated.md → ...cs/CommunityShare/Leetcode/2582-pillow.md
diff --git a/...Leetcode/2639. 查询网格图中每一列的宽度_translated.md → ...ocs/CommunityShare/Leetcode/2639-width.md b/...Leetcode/2639. 查询网格图中每一列的宽度_translated.md → ...ocs/CommunityShare/Leetcode/2639-width.md
diff --git a/...tyShare/Leetcode/2679.矩阵中的和_translated.md → ...ommunityShare/Leetcode/2679-matrix-sum.md b/...tyShare/Leetcode/2679.矩阵中的和_translated.md → ...ommunityShare/Leetcode/2679-matrix-sum.md
diff --git a/.../CommunityShare/Leetcode/2894. 分类求和并作差.md → .../CommunityShare/Leetcode/2894-sum-diff.md b/.../CommunityShare/Leetcode/2894. 分类求和并作差.md → .../CommunityShare/Leetcode/2894-sum-diff.md
diff --git a/...etcode/3072. 将元素分配到两个数组中 II_translated.md → ...ommunityShare/Leetcode/3072-distribute.md b/...etcode/3072. 将元素分配到两个数组中 II_translated.md → ...ommunityShare/Leetcode/3072-distribute.md
diff --git a/...inimum Length of Anagram Concatenation.md → ...s/CommunityShare/Leetcode/3138-anagram.md b/...inimum Length of Anagram Concatenation.md → ...s/CommunityShare/Leetcode/3138-anagram.md
diff --git a/...e/Leetcode/345. 反转字符串中的元音字母_translated.md → ...ocs/CommunityShare/Leetcode/345-vowels.md b/...e/Leetcode/345. 反转字符串中的元音字母_translated.md → ...ocs/CommunityShare/Leetcode/345-vowels.md
diff --git a/app/docs/CommunityShare/Leetcode/42.md → app/docs/CommunityShare/Leetcode/42-rain.md b/app/docs/CommunityShare/Leetcode/42.md → app/docs/CommunityShare/Leetcode/42-rain.md
diff --git a/app/docs/CommunityShare/Leetcode/46.全排列.md → ...ommunityShare/Leetcode/46-permutations.md b/app/docs/CommunityShare/Leetcode/46.全排列.md → ...ommunityShare/Leetcode/46-permutations.md
diff --git a/...e/Leetcode/538.把二叉搜索树转换为累加树_translated.md → app/docs/CommunityShare/Leetcode/538-bst.md b/...e/Leetcode/538.把二叉搜索树转换为累加树_translated.md → app/docs/CommunityShare/Leetcode/538-bst.md
diff --git a/...re/Leetcode/6323. 将钱分给最多的儿童_translated.md → ...ocs/CommunityShare/Leetcode/6323-money.md b/...re/Leetcode/6323. 将钱分给最多的儿童_translated.md → ...ocs/CommunityShare/Leetcode/6323-money.md
diff --git a/...nityShare/Leetcode/76最小覆盖子串_translated.md → .../CommunityShare/Leetcode/76-min-window.md b/...nityShare/Leetcode/76最小覆盖子串_translated.md → .../CommunityShare/Leetcode/76-min-window.md
diff --git a/.../CommunityShare/Leetcode/80_translated.md → .../CommunityShare/Leetcode/80-duplicates.md b/.../CommunityShare/Leetcode/80_translated.md → .../CommunityShare/Leetcode/80-duplicates.md
diff --git a/...ommunityShare/Leetcode/9021_TUT_3_25T1.md → app/docs/CommunityShare/Leetcode/9021-tut.md b/...ommunityShare/Leetcode/9021_TUT_3_25T1.md → app/docs/CommunityShare/Leetcode/9021-tut.md
diff --git a/app/docs/CommunityShare/Leetcode/93复原Ip地址.md → .../CommunityShare/Leetcode/93-ip-address.md b/app/docs/CommunityShare/Leetcode/93复原Ip地址.md → .../CommunityShare/Leetcode/93-ip-address.md
diff --git a/...ityShare/Leetcode/994.腐烂的橘子_translated.md → ...cs/CommunityShare/Leetcode/994-oranges.md b/...ityShare/Leetcode/994.腐烂的橘子_translated.md → ...cs/CommunityShare/Leetcode/994-oranges.md
diff --git a/...etcode/brief_alternate 作业帮忙_translated.md → ...CommunityShare/Leetcode/brief-homework.md b/...etcode/brief_alternate 作业帮忙_translated.md → ...CommunityShare/Leetcode/brief-homework.md
diff --git a/...ng Stars-Inter-Uni Programming Contest.md → ...CommunityShare/Leetcode/counting-stars.md b/...ng Stars-Inter-Uni Programming Contest.md → ...CommunityShare/Leetcode/counting-stars.md
diff --git a/...ffer II 021. 删除链表的倒数第 n 个结点_translated.md → ...ommunityShare/Leetcode/sword-offer-021.md b/...ffer II 021. 删除链表的倒数第 n 个结点_translated.md → ...ommunityShare/Leetcode/sword-offer-021.md
diff --git a/app/docs/[...slug]/page.tsx b/app/docs/[...slug]/page.tsx
@@ -26,6 +26,7 @@ interface Param {
 export default async function DocPage({ params }: Param) {
   const { slug } = await params;
   const page = source.getPage(slug);
+  console.log("正在尝试访问的Slug数组是：",slug);
 
   if (page == null) {
     notFound();
@@ -54,8 +55,8 @@ export default async function DocPage({ params }: Param) {
             </h1>
             <EditOnGithub href={editUrl} />
           </div>
-          <Mdx components={getMDXComponents()} />
-          <Contributors entry={contributorsEntry} />
+          <Mdx components={getMDXComponents()} /> 
+          <Contributors entry={contributorsEntry} /> 
           <PageFeedback />
           <section className="mt-16">
             <GiscusComments docId={docIdFromPage ?? null} />
@@ -78,10 +79,12 @@ export async function generateStaticParams() {
   return source.getPages().map((page) => ({
     slug: page.slugs,
   }));
+  console.log("正在生成StaticParams的Slug数组是：",source.getPages().map((page) => page.slugs));
 }
 
 export async function generateMetadata({ params }: Param): Promise<Metadata> {
   const { slug } = await params;
+  console.log("正在生成Metadata的Slug数组是：",slug);
   const page = source.getPage(slug);
   if (page == null) {
     notFound();