CakeCN/hsa
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix many feather

Browse Source
This commit is contained in:
Cai
2025-09-21 05:50:19 +00:00
parent b1f832a2fb
commit 25223ac6fe
89 changed files with 1746 additions and 454 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Html/apps/static/css/desktop.css
View File

@@ -114,7 +114,7 @@
/* 主容器，使用 grid 布局 */
#maxcontainer {
display: grid;
grid-template-columns: 1fr 5px 3fr 5px 1fr; /* 默认宽度比例 */
grid-template-columns: 2fr 5px 3fr 5px 1fr; /* 默认宽度比例 */
height: 100%;
}

9
Html/apps/static/js/lesson.js
View File

@@ -725,6 +725,10 @@ function sanitizeHeadingsBeyondFirst(text = "") {
// PUT 请求保存更新
try {
console.log("saveToOrigin", CURRENT.links.lesson, CURRENT.links.prompt, CURRENT.links.score);
console.log("updatedLesson", updatedLesson);
console.log("updatedPrompt", updatedPrompt);
console.log("updatedScore", updatedScore);
const result = await saveToOrigin({
lesson: { cdn_link: CURRENT.links.lesson, content: updatedLesson },
prompt: { cdn_link: CURRENT.links.prompt, content: updatedPrompt },
@@ -771,6 +775,11 @@ function sanitizeHeadingsBeyondFirst(text = "") {
// 替换该步骤内容
const lines = [...parsed.lines];
console.log("lines length", lines.length);
console.log("startLine", startLine);
console.log("endLine", endLine);
console.log("endLine - startLine + 1", endLine - startLine + 1);
console.log("newContent", newContent);
lines.splice(startLine, endLine - startLine + 1, newContent); // 用新内容替换
return lines.join('\n'); // 返回更新后的完整内容

9
Html/apps/static/基础算法-二分.html
View File

@@ -10,11 +10,8 @@
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/github-markdown-css/5.2.0/github-markdown.min.css">
</head>
<body class="markdown-body">
<h1>二分</h1>
<blockquote>
<p>Auto-generated at 2025-09-05 19:48</p>
</blockquote>
<h2>阶段一：示例阶段</h2>
<h1>二分查找与二分答案</h1>
<h2>二分查找</h2>
<h3>引入</h3>
<p>二分是一个很简单基础，但很重要的知识点，为以后许多高级的数据结构与算法铺垫。</p>
<p>下面是一个用二分的简单场景：</p>
@@ -47,7 +44,7 @@
<p>第三行一个整数q，表示询问的次数。(1&lt;=q&lt;=10^4)</p>
<p>后q行，每行一个整数b，表示询问的数。(0&lt;=b&lt;=10^8)</p>
<h5>输出</h5>
<p>q行，每行一个整数，对应每次询问的返回结果。</p>
<p>q行，每行一个整数，对应每次询问的返回结果</p>
<h5>提示：</h5>
<p>完成代码后，通知Agent进行评测。</p>
<p>如果你还不完全会这个算法，询问Agent获取提示并进行学习。</p>