fix(pr281): 修复 Copilot Review 提出的 6 处问题

1. top-docs/route.ts: limit 参数加 Number.isFinite 校验防 NaN
2. top-docs/route.ts: 返回结构统一为 ApiResponse{success,data}，补齐 title 字段
   （通过 fumadocs source.getPage 回填，同时保留埋点带来的 title）
3. HotDocsPreview.tsx: 改走同源 /api/analytics/top-docs 走 ISR，
   不再直连 BACKEND_URL，消除 '白做缓存' 问题
4. docs/[...slug]/page.tsx: generateMetadata 也按 locale 取页面，
   避免英文页显示中文 title/description
5. middleware.ts: Accept-Language 解析改为按 q 值排序取首选语言，
   正确处理 'fr-CA,fr;q=0.9,en;q=0.8' 这类多语言 header
6. computer-science/index.en.mdx: 删除正文末尾混入的整段中文

Author: longsizhuo

app/api/analytics/top-docs/route.ts

@@ -1,12 +1,36 @@
 import { prisma } from "@/lib/db";
 import { NextRequest } from "next/server";
+import { source } from "@/lib/source";
 
 export const revalidate = 300;
 
+/** 将 NaN/非正数的 limit 回退到默认值，同时加上限保护 */
+function parseLimit(raw: string | null, fallback = 5, max = 20): number {
+  const n = Number(raw);
+  if (!Number.isFinite(n) || n <= 0) return fallback;
+  return Math.min(Math.floor(n), max);
+}
+
+/**
+ * 从 path 尝试解析为文档标题：/docs/ai/rl → 查 fumadocs source
+ * 查不到时回退为 path 最后一段。
+ */
+function resolveTitle(path: string): string {
+  // /docs/ai/rl → ["ai", "rl"]
+  const slug = path
+    .replace(/^\/docs\/?/, "")
+    .split("/")
+    .filter(Boolean);
+  if (slug.length === 0) return path;
+  const page = source.getPage(slug);
+  if (page?.data?.title) return page.data.title as string;
+  return slug[slug.length - 1];
+}
+
 export async function GET(req: NextRequest) {
   const { searchParams } = new URL(req.url);
   const window = searchParams.get("window") ?? "7d";
-  const limit = Math.min(Number(searchParams.get("limit") ?? "5"), 20);
+  const limit = parseLimit(searchParams.get("limit"));
 
   const since = new Date();
   if (window === "7d") {
@@ -28,19 +52,27 @@ export async function GET(req: NextRequest) {
   });
 
   // 统计各路径 PV（内存过滤 /docs/ 前缀）
-  const counts: Record<string, number> = {};
+  const counts: Record<string, { count: number; title?: string }> = {};
   for (const row of rows) {
     const data = row.eventData as { path?: string; title?: string } | null;
     const path = data?.path;
     if (path && path.startsWith("/docs/")) {
-      counts[path] = (counts[path] ?? 0) + 1;
+      if (!counts[path]) counts[path] = { count: 0, title: data?.title };
+      counts[path].count += 1;
+      // 优先保留带 title 的埋点数据
+      if (!counts[path].title && data?.title) counts[path].title = data.title;
     }
   }
 
   const top = Object.entries(counts)
-    .sort((a, b) => b[1] - a[1])
+    .sort((a, b) => b[1].count - a[1].count)
     .slice(0, limit)
-    .map(([path, views]) => ({ path, views }));
+    .map(([path, { count, title }]) => ({
+      path,
+      title: title ?? resolveTitle(path),
+      views: count,
+    }));
 
-  return Response.json(top);
+  // 统一 ApiResponse 包裹，和后端 /analytics/top-docs 以及 /rank HotDocsTab 一致
+  return Response.json({ success: true, data: top });
 }

app/components/HotDocsPreview.tsx

@@ -7,16 +7,25 @@ interface TopDocDto {
 }
 
 async function fetchTopDocs(): Promise<TopDocDto[]> {
-  const backendUrl = process.env.BACKEND_URL ?? "http://localhost:8081";
+  // 同源请求 Next ISR 路由，避开对 BACKEND_URL 的硬依赖，
+  // 并复用 app/api/analytics/top-docs 的 revalidate=300 缓存。
+  // Server Component 中 fetch 需要绝对 URL，优先读显式站点地址，
+  // 其次 VERCEL_URL（预览/生产），本地回退到 3010。
+  const siteUrl =
+    process.env.NEXT_PUBLIC_SITE_URL ??
+    (process.env.VERCEL_URL ? `https://${process.env.VERCEL_URL}` : null) ??
+    "http://localhost:3010";
   try {
     const res = await fetch(
-      `${backendUrl}/analytics/top-docs?window=7d&limit=5`,
-      { next: { revalidate: 300 } },
+      `${siteUrl}/api/analytics/top-docs?window=7d&limit=5`,
+      {
+        next: { revalidate: 300 },
+      },
     );
     if (!res.ok) return [];
     const json = await res.json();
-    // 后端用 ApiResponse<List<TopDocDto>> 包裹，data 字段存实际数据
-    return json.data ?? json;
+    // 统一 ApiResponse<{ path, title, views }[]> 结构
+    return Array.isArray(json?.data) ? json.data : [];
   } catch {
     return [];
   }

app/docs/[...slug]/page.tsx

@@ -137,7 +137,9 @@ export async function generateStaticParams() {
 
 export async function generateMetadata({ params }: Param): Promise<Metadata> {
   const { slug } = await params;
-  const page = source.getPage(slug);
+  const locale = await getLocaleFromCookie();
+  // metadata 需与页面主体同语言，避免英文页显示中文 title/desc 造成 SEO 错乱
+  const { page } = getPageWithLocale(slug, locale);
   if (page == null) {
     notFound();
   }

app/docs/computer-science/index.en.mdx

@@ -42,34 +42,3 @@ We recommend learning in the following order:
 ---
 
 _This knowledge base is maintained by a student community. Contributions are welcome!_
-
-# 计算机科学
-
-欢迎来到计算机科学知识库！我们在此收集了计算机科学各个领域的核心概念和深入分析。
-
-## 主体内容
-
-### 数据结构和算法
-
-- [数据结构基础](/computer-science/data-structures)
-- 常见算法分析
-- 复杂性理论
-
-### 编程语言
-
-- 编程范式
-- 语言设计原则
-- 编译器理论
-
-## 学习建议
-
-我们建议按照以下顺序学习：
-
-1. 首先掌握基本的数据结构
-2. 理解常见算法的实现
-3. 学习算法复杂度分析
-4. 深入特定领域的高级主题
-
----
-
-_This knowledge base is maintained by a student community. Contributions are welcome!_

generated/site-leaderboard.json

@@ -28,33 +28,33 @@
       },
       {
         "id": "gmpls10e2dz0bbizotvhglc8",
-        "title": "Static Array",
-        "url": "/docs/computer-science/data-structures/array/01-static-array"
+        "title": "静态数组",
+        "url": "/docs/computer-science/data-structures/array/01-static-array.zh"
       },
       {
         "id": "nuojcaq1s6r5nggul0uq3r3j",
-        "title": "Dynamic Array",
-        "url": "/docs/computer-science/data-structures/array/02-dynamic-array"
+        "title": "动态数组",
+        "url": "/docs/computer-science/data-structures/array/02-dynamic-array.zh"
       },
       {
         "id": "ai7cmwf4irjaobqf7uokj3b4",
-        "title": "Array",
-        "url": "/docs/computer-science/data-structures/array"
+        "title": "数组",
+        "url": "/docs/computer-science/data-structures/array/index.zh"
       },
       {
         "id": "vti0bt2qlnr681msbk6igznc",
-        "title": "Data Structures Fundamentals",
-        "url": "/docs/computer-science/data-structures"
+        "title": "数据结构基础",
+        "url": "/docs/computer-science/data-structures/index.zh"
       },
       {
         "id": "gkjk6stzpb44n9lv8u2ij7xx",
-        "title": "Singly Linked List",
-        "url": "/docs/computer-science/data-structures/linked-list/01-singly-linked-list"
+        "title": "单链表",
+        "url": "/docs/computer-science/data-structures/linked-list/01-singly-linked-list.zh"
       },
       {
         "id": "lt9yrqt0ksl2liabq9ocw0z4",
-        "title": "Linked List",
-        "url": "/docs/computer-science/data-structures/linked-list"
+        "title": "链表",
+        "url": "/docs/computer-science/data-structures/linked-list/index.zh"
       },
       {
         "id": "i88bna4sg5pr4ekhg32drv2i",
@@ -549,7 +549,7 @@
       {
         "id": "l6eepr5ctjgrhdgupy3twr1t",
         "title": "Prompt Repetition Improves Non-Reasoning LLMs",
-        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms"
+        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.zh"
       },
       {
         "id": "rv6egbynttb4mt1n0412bue0",
@@ -658,8 +658,8 @@
       },
       {
         "id": "fostlzqqx6l10qz1egd8dw5m",
-        "title": "Counting Stars-Inter-Uni Programming Contest.md",
-        "url": "/docs/CommunityShare/Leetcode/Counting Stars-Inter-Uni Programming Contest"
+        "title": "Counting Stars — 校际编程竞赛",
+        "url": "/docs/CommunityShare/Leetcode/counting-stars-inter-uni-programming-contest.zh"
       },
       {
         "id": "l4db26ijmpeivh78a21981ia",
@@ -1168,7 +1168,7 @@
       {
         "id": "l6eepr5ctjgrhdgupy3twr1t",
         "title": "Prompt Repetition Improves Non-Reasoning LLMs",
-        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms"
+        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.zh"
       }
     ]
   },
@@ -1181,33 +1181,33 @@
     "contributedDocs": [
       {
         "id": "gmpls10e2dz0bbizotvhglc8",
-        "title": "Static Array",
-        "url": "/docs/computer-science/data-structures/array/01-static-array"
+        "title": "静态数组",
+        "url": "/docs/computer-science/data-structures/array/01-static-array.zh"
       },
       {
         "id": "nuojcaq1s6r5nggul0uq3r3j",
-        "title": "Dynamic Array",
-        "url": "/docs/computer-science/data-structures/array/02-dynamic-array"
+        "title": "动态数组",
+        "url": "/docs/computer-science/data-structures/array/02-dynamic-array.zh"
       },
       {
         "id": "ai7cmwf4irjaobqf7uokj3b4",
-        "title": "Array",
-        "url": "/docs/computer-science/data-structures/array"
+        "title": "数组",
+        "url": "/docs/computer-science/data-structures/array/index.zh"
       },
       {
         "id": "vti0bt2qlnr681msbk6igznc",
-        "title": "Data Structures Fundamentals",
-        "url": "/docs/computer-science/data-structures"
+        "title": "数据结构基础",
+        "url": "/docs/computer-science/data-structures/index.zh"
       },
       {
         "id": "gkjk6stzpb44n9lv8u2ij7xx",
-        "title": "Singly Linked List",
-        "url": "/docs/computer-science/data-structures/linked-list/01-singly-linked-list"
+        "title": "单链表",
+        "url": "/docs/computer-science/data-structures/linked-list/01-singly-linked-list.zh"
       },
       {
         "id": "lt9yrqt0ksl2liabq9ocw0z4",
-        "title": "Linked List",
-        "url": "/docs/computer-science/data-structures/linked-list"
+        "title": "链表",
+        "url": "/docs/computer-science/data-structures/linked-list/index.zh"
       },
       {
         "id": "ksjj9shalh6hqezx6t6am5vw",
@@ -1631,7 +1631,7 @@
       {
         "id": "l6eepr5ctjgrhdgupy3twr1t",
         "title": "Prompt Repetition Improves Non-Reasoning LLMs",
-        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms"
+        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.zh"
       }
     ]
   },
@@ -1645,7 +1645,7 @@
       {
         "id": "l6eepr5ctjgrhdgupy3twr1t",
         "title": "Prompt Repetition Improves Non-Reasoning LLMs",
-        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms"
+        "url": "/docs/CommunityShare/Amazing-AI-Tools/prompt-repetition-improves-non-reasoning-llms.zh"
       }
     ]
   },

middleware.ts

@@ -21,11 +21,27 @@ export function middleware(req: NextRequest) {
     (req as NextRequest & { geo?: { country?: string } }).geo?.country ?? "";
   const acceptLang = req.headers.get("accept-language") ?? "";
 
-  // 默认中文；只有明确英文 Accept-Language 且非中国 IP 才切 en
+  // 解析 Accept-Language header 按 q 值排序的优先级列表
+  // 例如 "fr-CA,fr;q=0.9,en;q=0.8,zh;q=0.5" → [fr-CA, fr, en, zh]
+  // 之前只 startsWith 判断会忽略 q 值较低但明确列出的语言。
+  const preferred = acceptLang
+    .split(",")
+    .map((part) => {
+      const [tag, ...params] = part.trim().split(";");
+      const qParam = params.find((p) => p.trim().startsWith("q="));
+      const q = qParam ? parseFloat(qParam.slice(2)) : 1;
+      return { tag: tag.toLowerCase(), q: Number.isFinite(q) ? q : 0 };
+    })
+    .filter((item) => item.tag)
+    .sort((a, b) => b.q - a.q);
+
+  const firstMatch = preferred.find((item) =>
+    /^(en|zh)(-|$)/.test(item.tag),
+  )?.tag;
+
+  // 默认中文；只有 Accept-Language 首选为英文且非中国 IP 才切 en
   const isExplicitlyEnglish =
-    !acceptLang.toLowerCase().startsWith("zh") &&
-    acceptLang.toLowerCase().startsWith("en") &&
-    country !== "CN";
+    firstMatch?.startsWith("en") === true && country !== "CN";
   const locale = isExplicitlyEnglish ? "en" : "zh";
 
   const res = NextResponse.next();