Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -391,7 +391,7 @@ console.log(charCode.toString(16)); // "1f600" —— 真实码点
- 前提条件:数据必须有序
- 优点:搜索效率高!

![](/images/Pasted%20image%2020251117200155.png)
![](/images/Pasted-image-20251117200155.png)

上图为时间复杂度比较,普通搜索算法为 $O(n)$
二分查找为
Expand Down
4 changes: 2 additions & 2 deletions docs/courses/week1/CS50第1讲笔记:C语言.md
Original file line number Diff line number Diff line change
Expand Up @@ -38,8 +38,8 @@ CS50 使用基于云端的 VS Code (Codespaces)。
- `mv <source> <dest>`: 移动或重命名文件。

- `code <file>`: 在编辑器中打开或创建文件。
[^1] ![典](../../public/images/典.png)
![Pasted image](../../public/images/Pasted%20image%2020251124181501.png)
[^1] ![典](/images/典.png)
<!-- MISSING IMAGE: ![Pasted image](/images/pasted-image-20251124-181501.png) -->

<!-- 把下面这行写成注释/普通文字,避免被 VitePress 当作链接定义解析为相对链接导致死链 -->
注:参考文献(非链接) — 具体来源可在必要时补充 URL 或外部引用。
Expand Down
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
## 第七题 mario
![pyramid](../../public/images/pyramid.png)
![pyramid](/images/pyramid.png)
### 不太自在的版本
```c
//题目集1,marioless金字塔解
Expand Down Expand Up @@ -84,7 +84,7 @@ int main(){
```

### 更自在的版本
![pyramids](../../public/images/pyramids.png)
![pyramids](/images/pyramids.png)
```c
//题目集1,marioless对称金字塔一解

Expand Down
5 changes: 5 additions & 0 deletions docs/courses/week2/Week2 题目集:个人解题方法.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| 1 | 3 | 3 | 2 | 1 | 4 | 2 | 4 | 1 | 8 | 5 | 1 | 3 | 1 | 1 | 3 | 10 | 1 | 1 | 1 | 1 | 4 | 4 | 8 | 4 | 10 |





在拼字游戏中,玩家创造单词得分,得分是单词中每个字母分数的总和。
实现一个用 C 语言实现的程序,决定一个类似拼字游戏的获胜者。你的程序应该会提示输入两次:“玩家 1”输入词语“一次,”玩家 2“输入词语一次。然后,根据得分最高的玩家,你的程序应打印“玩家 1 获胜!”、“玩家 2 获胜!”或“平局!”(如果两名玩家得分相等,则为 2 名玩家。)、

Expand Down
Binary file removed docs/public/images/Pasted image 20251113180047.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251113190428.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251114115530.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251116173916.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251117114546.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251117172237.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251125172045.png
Binary file not shown.
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251125214108.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251125214609.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251126090226.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251126090545.png
Binary file not shown.
Binary file removed docs/public/images/Pasted image 20251126090924.png
Binary file not shown.