fix(seo): 回应 CR 删 no-locale 兜底 301 + 补 dotted 中文 leetcode 旧 URL 301

CR（Copilot）：next.config 的 `/docs/:path*` → `/zh/docs/:path*` 兜底是 301
（永久），抢在 next-intl middleware 之前把所有无前缀 /docs 链接（Hero/Footer
站内链接 + 外链）强制钉到 zh，英文用户再也协商不到 /en 且被浏览器/Google
缓存。删掉，无前缀路径交回 next-intl 按 Accept-Language/cookie 协商（307 单跳）。

dotted 中文 leetcode 旧 URL（46.全排列 / 1234. 替换… 这类带点的）此前被
proxy.ts matcher 的 .*\..* 排除、进不了 slug-map 301，只能硬 404。三处改动：
- matcher 给 leetcode 开口：(?!.*[Ll]eetcode).*\..*，带点的 leetcode 路径放进中间件
- slug-map value 改成完整 canonical URL：按题号优先指向英文页 /en（.en.md 一定
  200），无英文兄弟才退回 zh 拼音；并加 byNumber 兜住「中文文件已改名成英文、
  旧中文 URL 仍在 GSC」的题（46.全排列→46-permutations）
- 题号兜底仅对含中文的 slug 生效，避免英文 canonical slug 自我重定向成环 /
  把合法 /zh 英文命名页打到 /en

leetcode canonical 逻辑抽到 lib/leetcode-slug.ts（buildLeetcodeAsciiSlugByNumber
/ leetcodeCanonicalUrl），proxy.ts、slug-map 脚本、排行榜生成共用同一真源。

dev 实测：46.全排列 / [213]打家劫舍 / 93复原Ip地址 / 1234.替换 / 2894.分类 全部
301→200；/en/46-permutations、/zh/46-permutations 等 canonical 页不被劫持无环；
排行榜仍 153/153；sitemap/robots/普通路由无回归。

Co-authored-by: copilot-pull-request-reviewer[bot] <198982749+Copilot@users.noreply.github.com>

Author: github-actions[bot]

generated/leetcode-slug-map.json

@@ -1,30 +1,74 @@
 {
-  "1234. 替换子串得到平衡字符串_translated": "1234-ti-huan-zi-chuan-de-dao-ping-heng-zi-fu-chuan-translated",
-  "142.环形链表II_translated": "142-huan-xing-lian-biao-iitranslated",
-  "1653. 使字符串平衡的最少删除次数_translated": "1653-shi-zi-fu-chuan-ping-heng-de-zui-shao-shan-chu-ci-shu-translated",
-  "1664生成平衡数组的方案数_translated": "1664-sheng-cheng-ping-heng-shu-zu-de-fang-an-shu-translated",
-  "1825求出 MK 平均值_translated": "1825-qiu-chu-mk-ping-jun-zhi-translated",
-  "1828统计一个圆中点的数目_translated": "1828-tong-ji-yi-ge-yuan-zhong-dian-de-shu-mu-translated",
-  "2299强密码检验器II_translated": "2299-qiang-mi-ma-jian-yan-qi-iitranslated",
-  "2309兼具大小写的最好英文字母_translated": "2309-jian-ju-da-xiao-xie-de-zui-hao-ying-wen-zi-mu-translated",
-  "2335. 装满杯子需要的最短总时长_translated": "2335-zhuang-man-bei-zi-xu-yao-de-zui-duan-zong-shi-chang-translated",
-  "2341. 数组能形成多少数对_translated": "2341-shu-zu-neng-xing-cheng-duo-shao-shu-dui-translated",
-  "2639. 查询网格图中每一列的宽度_translated": "2639-cha-xun-wang-ge-tu-zhong-mei-yi-lie-de-kuan-du-translated",
-  "2679.矩阵中的和_translated": "2679-ju-zhen-zhong-de-he-translated",
-  "2894. 分类求和并作差": "2894-fen-lei-qiu-he-bing-zuo-cha",
-  "3072. 将元素分配到两个数组中 II_translated": "3072-jiang-yuan-su-fen-pei-dao-liang-ge-shu-zu-zhong-iitranslated",
-  "345. 反转字符串中的元音字母_translated": "345-fan-zhuan-zi-fu-chuan-zhong-de-yuan-yin-zi-mu-translated",
-  "538.把二叉搜索树转换为累加树_translated": "538-ba-er-cha-sou-suo-shu-zhuan-huan-wei-lei-jia-shu-translated",
-  "6323. 将钱分给最多的儿童_translated": "6323-jiang-qian-fen-gei-zui-duo-de-er-tong-translated",
-  "76最小覆盖子串_translated": "76-zui-xiao-fu-gai-zi-chuan-translated",
-  "994.腐烂的橘子_translated": "994-fu-lan-de-ju-zi-translated",
-  "[121]买卖股票的最佳时期_translated": "121-mai-mai-gu-piao-de-zui-jia-shi-qi-translated",
-  "[1333]餐厅过滤器_translated": "1333-can-ting-guo-l-qi-translated",
-  "[146]LRU 缓存_translated": "146lru-huan-cun-translated",
-  "[213]打家劫舍 II_translated": "213-da-jia-jie-she-iitranslated",
-  "[2490]回环句_translated": "2490-hui-huan-ju-translated",
-  "[2562]找出数组的串联值_translated": "2562-zhao-chu-shu-zu-de-chuan-lian-zhi-translated",
-  "[2582]递枕头_translated": "2582-di-zhen-tou-translated",
-  "brief_alternate 作业帮忙_translated": "briefalternate-zuo-ye-bang-mang-translated",
-  "剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated": "jian-zhi-offerii021-shan-chu-lian-biao-de-dao-shu-di-n-ge-jie-dian-translated"
+  "byName": {
+    "1234. 替换子串得到平衡字符串_translated": "/en/docs/career/interview-prep/leetcode/1234-replace-substring-for-balanced-string",
+    "142.环形链表II_translated": "/en/docs/career/interview-prep/leetcode/142-linked-list-cycle-ii",
+    "1653. 使字符串平衡的最少删除次数_translated": "/en/docs/career/interview-prep/leetcode/1653-minimum-deletions-to-make-string-balanced",
+    "1664生成平衡数组的方案数_translated": "/en/docs/career/interview-prep/leetcode/1664-ways-to-make-a-fair-array",
+    "1825求出 MK 平均值_translated": "/en/docs/career/interview-prep/leetcode/1825-mk-average",
+    "1828统计一个圆中点的数目_translated": "/en/docs/career/interview-prep/leetcode/1828-queries-on-number-of-points-inside-a-circle",
+    "2299强密码检验器II_translated": "/en/docs/career/interview-prep/leetcode/2299-strong-password-checker-ii",
+    "2309兼具大小写的最好英文字母_translated": "/en/docs/career/interview-prep/leetcode/2309-greatest-english-letter-in-upper-and-lower-case",
+    "2335. 装满杯子需要的最短总时长_translated": "/en/docs/career/interview-prep/leetcode/2335-minimum-amount-of-time-to-fill-cups",
+    "2341. 数组能形成多少数对_translated": "/en/docs/career/interview-prep/leetcode/2341-maximum-number-of-pairs-in-array",
+    "2639. 查询网格图中每一列的宽度_translated": "/en/docs/career/interview-prep/leetcode/2639-find-column-width-of-grid",
+    "2679.矩阵中的和_translated": "/en/docs/career/interview-prep/leetcode/2679-sum-in-a-matrix",
+    "2894. 分类求和并作差": "/en/docs/career/interview-prep/leetcode/2894-divisible-and-non-divisible-sums-difference",
+    "3072. 将元素分配到两个数组中 II_translated": "/en/docs/career/interview-prep/leetcode/3072-distribute-elements-into-two-arrays-ii",
+    "345. 反转字符串中的元音字母_translated": "/en/docs/career/interview-prep/leetcode/345-reverse-vowels-of-a-string",
+    "538.把二叉搜索树转换为累加树_translated": "/en/docs/career/interview-prep/leetcode/538-convert-bst-to-greater-sum-tree",
+    "6323. 将钱分给最多的儿童_translated": "/en/docs/career/interview-prep/leetcode/6323-distribute-money-to-maximum-children",
+    "76最小覆盖子串_translated": "/en/docs/career/interview-prep/leetcode/76-minimum-window-substring",
+    "994.腐烂的橘子_translated": "/en/docs/career/interview-prep/leetcode/994-rotting-oranges",
+    "[121]买卖股票的最佳时期_translated": "/en/docs/career/interview-prep/leetcode/121-best-time-to-buy-and-sell-stock",
+    "[1333]餐厅过滤器_translated": "/en/docs/career/interview-prep/leetcode/1333-filter-restaurants-by-vegan-friendly-price-and-distance",
+    "[146]LRU 缓存_translated": "/en/docs/career/interview-prep/leetcode/146-lru-cache",
+    "[213]打家劫舍 II_translated": "/en/docs/career/interview-prep/leetcode/213-house-robber-ii",
+    "[2490]回环句_translated": "/en/docs/career/interview-prep/leetcode/2490-circular-sentence",
+    "[2562]找出数组的串联值_translated": "/en/docs/career/interview-prep/leetcode/2562-find-the-array-concatenation-value",
+    "[2582]递枕头_translated": "/en/docs/career/interview-prep/leetcode/2582-pass-the-pillow",
+    "brief_alternate 作业帮忙_translated": "/zh/docs/career/interview-prep/leetcode/briefalternate-zuo-ye-bang-mang-translated",
+    "剑指 Offer II 021. 删除链表的倒数第 n 个结点_translated": "/en/docs/career/interview-prep/leetcode/sword-offer-ii-021-remove-nth-node-from-end-of-list"
+  },
+  "byNumber": {
+    "42": "/en/docs/career/interview-prep/leetcode/42-trapping-rain-water",
+    "46": "/en/docs/career/interview-prep/leetcode/46-permutations",
+    "76": "/en/docs/career/interview-prep/leetcode/76-minimum-window-substring",
+    "80": "/en/docs/career/interview-prep/leetcode/80-remove-duplicates-from-sorted-array-ii",
+    "93": "/en/docs/career/interview-prep/leetcode/93-restore-ip-addresses",
+    "121": "/en/docs/career/interview-prep/leetcode/121-best-time-to-buy-and-sell-stock",
+    "142": "/en/docs/career/interview-prep/leetcode/142-linked-list-cycle-ii",
+    "146": "/en/docs/career/interview-prep/leetcode/146-lru-cache",
+    "213": "/en/docs/career/interview-prep/leetcode/213-house-robber-ii",
+    "219": "/en/docs/career/interview-prep/leetcode/219-contains-duplicate-ii",
+    "345": "/en/docs/career/interview-prep/leetcode/345-reverse-vowels-of-a-string",
+    "538": "/en/docs/career/interview-prep/leetcode/538-convert-bst-to-greater-sum-tree",
+    "994": "/en/docs/career/interview-prep/leetcode/994-rotting-oranges",
+    "1004": "/en/docs/career/interview-prep/leetcode/1004-max-consecutive-ones-iii",
+    "1234": "/en/docs/career/interview-prep/leetcode/1234-replace-substring-for-balanced-string",
+    "1333": "/en/docs/career/interview-prep/leetcode/1333-filter-restaurants-by-vegan-friendly-price-and-distance",
+    "1545": "/en/docs/career/interview-prep/leetcode/1545-find-kth-bit-in-nth-binary-string",
+    "1653": "/en/docs/career/interview-prep/leetcode/1653-minimum-deletions-to-make-string-balanced",
+    "1664": "/en/docs/career/interview-prep/leetcode/1664-ways-to-make-a-fair-array",
+    "1825": "/en/docs/career/interview-prep/leetcode/1825-mk-average",
+    "1828": "/en/docs/career/interview-prep/leetcode/1828-queries-on-number-of-points-inside-a-circle",
+    "2131": "/en/docs/career/interview-prep/leetcode/2131-longest-palindrome-by-concatenating-two-letter-words",
+    "2241": "/en/docs/career/interview-prep/leetcode/2241-design-an-atm-machine",
+    "2270": "/en/docs/career/interview-prep/leetcode/2270-number-of-ways-to-split-array",
+    "2293": "/en/docs/career/interview-prep/leetcode/2293-min-max-game",
+    "2299": "/en/docs/career/interview-prep/leetcode/2299-strong-password-checker-ii",
+    "2309": "/en/docs/career/interview-prep/leetcode/2309-greatest-english-letter-in-upper-and-lower-case",
+    "2335": "/en/docs/career/interview-prep/leetcode/2335-minimum-amount-of-time-to-fill-cups",
+    "2341": "/en/docs/career/interview-prep/leetcode/2341-maximum-number-of-pairs-in-array",
+    "2490": "/en/docs/career/interview-prep/leetcode/2490-circular-sentence",
+    "2562": "/en/docs/career/interview-prep/leetcode/2562-find-the-array-concatenation-value",
+    "2582": "/en/docs/career/interview-prep/leetcode/2582-pass-the-pillow",
+    "2639": "/en/docs/career/interview-prep/leetcode/2639-find-column-width-of-grid",
+    "2679": "/en/docs/career/interview-prep/leetcode/2679-sum-in-a-matrix",
+    "2894": "/en/docs/career/interview-prep/leetcode/2894-divisible-and-non-divisible-sums-difference",
+    "3072": "/en/docs/career/interview-prep/leetcode/3072-distribute-elements-into-two-arrays-ii",
+    "3138": "/en/docs/career/interview-prep/leetcode/3138-minimum-length-of-anagram-concatenation",
+    "6323": "/en/docs/career/interview-prep/leetcode/6323-distribute-money-to-maximum-children",
+    "9021": "/en/docs/career/interview-prep/leetcode/9021-tut-3-25t1",
+    "021": "/en/docs/career/interview-prep/leetcode/sword-offer-ii-021-remove-nth-node-from-end-of-list"
+  }
 }

lib/leetcode-slug.ts

@@ -28,3 +28,46 @@ export function convertSlugToPinyin(text: string): string {
     .filter(Boolean)
     .join("-");
 }
+
+/** leetcode 目录相对 content/docs 的路径（= 对外 URL 里 /docs 之后的固定段）。*/
+export const LEETCODE_DIR_SLUG = "career/interview-prep/leetcode";
+
+/**
+ * 从 leetcode 目录的文件名列表构建「题号 → 英文 ASCII slug」映射。
+ *
+ * 英文命名文件（`1234-replace-....en.md`）的 ASCII slug 一定能被 fumadocs 解析、
+ * 一定 200；中文翻译文件名经 i18n 解析后的真实 slug 不可预测（带 `. ` 的会塌缩、
+ * 带方括号的能独立成拼音页）。所以同一题优先用英文 slug 当 canonical。
+ */
+export function buildLeetcodeAsciiSlugByNumber(
+  filenames: string[],
+): Map<string, string> {
+  const map = new Map<string, string>();
+  for (const f of filenames) {
+    if (!/\.(md|mdx)$/i.test(f)) continue;
+    const stem = f.replace(/\.(md|mdx)$/i, "").replace(/\.(en|zh)$/i, "");
+    if (/[^\x00-\x7f]/.test(stem)) continue; // 含非 ASCII = 中文命名，不是 canonical 来源
+    if (/_translated$/i.test(stem)) continue; // 英文名也带 _translated 的极少数
+    const num = stem.match(/(\d+)/); // 题号（取第一段数字，兼容 1234- / sword-offer-ii-021）
+    if (!num) continue;
+    if (!map.has(num[1])) map.set(num[1], stem);
+  }
+  return map;
+}
+
+/**
+ * 给一个 leetcode 文件的 stem（已去 locale / 扩展名后缀），算它的真实 canonical URL。
+ *
+ * 英文页只在 `/en` 渲染（`.en.md`，zh 不回退 en），所以按题号命中英文 slug 时一律
+ * 指向 `/en`；命不中（无英文兄弟）才退回 `/zh` 拼音页。`index` 对应目录根。
+ */
+export function leetcodeCanonicalUrl(
+  stem: string,
+  asciiByNumber: Map<string, string>,
+): string {
+  if (stem === "index") return `/zh/docs/${LEETCODE_DIR_SLUG}`;
+  const num = stem.match(/(\d+)/);
+  const ascii = num ? asciiByNumber.get(num[1]) : undefined;
+  if (ascii) return `/en/docs/${LEETCODE_DIR_SLUG}/${ascii}`;
+  return `/zh/docs/${LEETCODE_DIR_SLUG}/${convertSlugToPinyin(stem)}`;
+}

next.config.mjs

@@ -280,15 +280,11 @@ const config = {
         statusCode: 301,
       },
 
-      // ============= 兜底：no-locale /docs 一律送默认 locale =============
-      // 段化后 canonical 必带 locale 前缀，任何裸 /docs/... 都是旧链接（外链 /
-      // GSC / 热榜 DB 旧路径）。必须排在所有具体规则之后，让特化规则先命中。
-      // 目的地带 /zh 前缀，不会再被本规则匹配，无重定向环。
-      {
-        source: "/docs/:path*",
-        destination: "/zh/docs/:path*",
-        statusCode: 301,
-      },
+      // 注意：不要在这里加 `/docs/:path*` → `/zh/docs/:path*` 的 no-locale 兜底。
+      // 那是个 301（永久），会抢在 next-intl middleware 之前把所有无前缀 /docs
+      // 链接（Hero / Footer 站内链接 + 外链）强制钉到 zh，英文用户再也协商不到
+      // /en（且被浏览器/Google 缓存）。无前缀路径交给 next-intl 按 Accept-Language
+      // / NEXT_LOCALE 协商（307，单跳到 /zh 或 /en）才是对的。
     ];
   },
   async rewrites() {

proxy.ts

@@ -18,8 +18,16 @@ import { routing } from "@/i18n/routing";
  *   - URL 段化后，匹配规则 matcher 也得放宽到全站（不限于 /docs/:path*）
  */
 
-const SLUG_MAP = new Map<string, string>(
-  Object.entries(leetcodeSlugMap as Record<string, string>),
+// generated/leetcode-slug-map.json：
+//   byName   中文文件名（decode 后）→ 完整 canonical 路径（含无英文兄弟时的 zh 拼音页）
+//   byNumber 题号 → 英文页，兜住「中文文件已改名成英文、旧中文 URL 在 GSC 还活着」
+const slugMap = leetcodeSlugMap as {
+  byName: Record<string, string>;
+  byNumber: Record<string, string>;
+};
+const SLUG_BY_NAME = new Map<string, string>(Object.entries(slugMap.byName));
+const SLUG_BY_NUMBER = new Map<string, string>(
+  Object.entries(slugMap.byNumber),
 );
 
 // 既要兼容老的不带 locale 前缀的 URL（/docs/...），也要兼容已经带 locale 的
@@ -85,15 +93,29 @@ function redirectLeetcodeIfNeeded(req: NextRequest): NextResponse | null {
     rawSlug = rest;
   }
 
-  const mapped = SLUG_MAP.get(rawSlug);
-  const targetSlug = mapped ?? rawSlug;
-
-  // 新路径 + ASCII slug 命中原样：放行，不绕圈
-  if (baseMatched === "new" && !mapped) return null;
+  // value 是完整 canonical 路径（含 locale 前缀）。先按文件名精确查（覆盖只有 zh
+  // 拼音页的情况），命不中再按题号查（兜住已改名成英文、旧中文 URL 仍存活的题）。
+  //
+  // 题号兜底只对“含中文的 slug”生效：canonical 英文 slug（46-permutations）和
+  // 合法的拼音页都是纯 ASCII，若也按题号重定向会把英文页指向自己造成 301 死循环、
+  // 或把合法 /zh 英文命名页强行打到 /en。中文旧 URL 才需要这层兜底。
+  const numMatch = rawSlug.match(/(\d+)/);
+  const hasNonAscii = /[^\x00-\x7f]/.test(rawSlug);
+  const mapped =
+    SLUG_BY_NAME.get(rawSlug) ??
+    (hasNonAscii && numMatch ? SLUG_BY_NUMBER.get(numMatch[1]) : undefined);
+  if (mapped) {
+    const url = req.nextUrl.clone();
+    url.pathname = mapped;
+    url.search = "";
+    return NextResponse.redirect(url, 301);
+  }
 
-  // 否则 301 到（带 locale 前缀的）拼音 URL
+  // 未映射 = 英文 / ASCII slug，真实 slug == rawSlug：
+  // 新前缀已经正确，放行不绕圈；老前缀只换前缀（默认 zh，_translated 等都是 zh 文件）。
+  if (baseMatched === "new") return null;
   const url = req.nextUrl.clone();
-  url.pathname = `${localePrefix}${LEETCODE_PATH_TAIL}/${targetSlug}`;
+  url.pathname = `${localePrefix || `/${routing.defaultLocale}`}${LEETCODE_PATH_TAIL}/${rawSlug}`;
   return NextResponse.redirect(url, 301);
 }
 
@@ -122,6 +144,10 @@ export const config = {
   //   rewrite source（/oauth/:path*）不匹配带 locale 的版本（/en/oauth/...），
   //   落到 [locale]/oauth/... 404。所以必须排除掉，让请求直接走 rewrite。
   // - _next / _vercel：Next.js 内部
-  // - .*\..*：任何带 . 的路径（静态资源 / sitemap.xml / robots.txt 等）
-  matcher: "/((?!api|trpc|auth|oauth|analytics|_next|_vercel|.*\\..*).*)",
+  // - (?!.*[Ll]eetcode).*\..*：带 . 的路径（静态资源 / sitemap.xml 等）一律排除，
+  //   但 leetcode 例外——GSC 旧 URL 里有大量带点的中文题名（"46.全排列"、
+  //   "1234. 替换…"），不放进来就触不到上面的 slug-map 301，只能硬 404。
+  //   leetcode 目录下不存在带点的静态资源，开这个口子安全。
+  matcher:
+    "/((?!api|trpc|auth|oauth|analytics|_next|_vercel|(?!.*[Ll]eetcode).*\\..*).*)",
 };