forked from trekhleb/javascript-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add Chinese Translation (trekhleb#815)
Co-authored-by: Oleksii Trekhleb <trehleb@gmail.com>
- Loading branch information
1 parent
53781db
commit dd3cbe1
Showing
4 changed files
with
42 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
19 changes: 19 additions & 0 deletions
19
src/algorithms/linked-list/reverse-traversal/README.zh-CN.md
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
# 链表倒序遍历 | ||
|
||
我们的任务是倒序遍历给定的链表 | ||
|
||
比如下面的链表 | ||
|
||
![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg) | ||
|
||
遍历的顺序应该是 | ||
|
||
```text | ||
37 → 99 → 12 | ||
``` | ||
|
||
因为我们每个节点只访问一次,时间复杂度应该是`O(n)` | ||
|
||
## 参考 | ||
|
||
- [Wikipedia](https://zh.wikipedia.org/wiki/%E9%93%BE%E8%A1%A8) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
# 链表遍历 | ||
|
||
我们的任务是顺序遍历给定的链表 | ||
|
||
比如下面的链表 | ||
|
||
![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg) | ||
|
||
遍历的顺序应该是 | ||
|
||
```text | ||
12 → 99 → 37 | ||
``` | ||
|
||
因为我们每个节点只访问一次,时间复杂度应该是`O(n)` | ||
|
||
## 参考 | ||
|
||
- [Wikipedia](https://zh.wikipedia.org/wiki/%E9%93%BE%E8%A1%A8) |