forked from hantmac/Mastering_Go_ZH_CN
-
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.
- Loading branch information
kasheemlew
committed
May 4, 2019
1 parent
e16d2a1
commit 07d63c3
Showing
9 changed files
with
42 additions
and
23 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
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 |
---|---|---|
@@ -1,7 +1,7 @@ | ||
### 链表的优点 | ||
|
||
链表最大的有点就是容易理解和实现。链表的通用型使得它们可以用于很多不同的情形。这意味着可以用它们对各种不同类型的数据建模。此外,在链表中使用指针进行顺序检索的速度非常快。 | ||
链表最大的有点就是容易理解和实现。链表的通用性使得它们可以用于很多不同的情形。这意味着可以用链表对各种不同类型的数据建模。此外,在链表中使用指针进行顺序检索的速度非常快。 | ||
|
||
链表不仅可以帮你对数据排序,还可以在插入和删除元素之后帮你保持数据的有序性。从有序链表中删除一个节点的操作与无序链表中相同。然而,向有序链表中插入新的节点则与无需链表中不同,为了保持链表的有序性,必须将新节点放到正确的位置。实践过程中,这意味着如果你有大量数据并且会频繁删除数据,那么相对于哈希表和二叉树,使用链表是一个更好的选择。 | ||
链表不仅可以对数据排序,还可以在插入和删除元素之后保持数据的有序性。从有序链表中删除一个节点的操作与无序链表中相同,而向有序链表中插入新的节点则与无需链表中不同,为了保持链表的有序性,必须将新节点放到正确的位置。实际上,这意味着如果你有大量数据并且会频繁删除数据,那么相对于哈希表和二叉树,使用链表是一个更好的选择。 | ||
|
||
最后,**有序链表**允许你在搜索和查找节点时使用各种优化技术。其中最通用一种就是保存一个指向游戏链表中间节点的指针,然后从这里开始进行查找。这个简单的优化方法可以将查找操作的时间减少一半。 | ||
最后,有很多技术可以优化**有序链表**中搜索和查找节点的过程。其中最常用的一种就是保存一个指向有序链表中间节点的指针,之后每次都从这个节点开始查找。这个简单的优化方法可以将查找操作的时间减少一半! |
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
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
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
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 |
---|---|---|
@@ -1,5 +1,5 @@ | ||
### Go 语言中的栈 | ||
|
||
**栈**是一种看起来像一堆盘子的数据结构。在你需要一个新盘子时,最后一个被放在这堆盘子顶端的盘子将会最先被使用。 | ||
**栈**是一种看起来像一堆盘子的数据结构。你在需要一个新盘子时会先使用最后一个被放在这堆盘子顶端的那个盘子。 | ||
|
||
栈最大的有点就是简单,因为你只需要实现两个函数就能使用栈,向栈中添加新节点或者删除栈中的节点。 | ||
栈最大的优点就是简单,因为你只需要实现两个函数就能使用栈,之后你可以向栈中添加新节点或者删除栈中的节点。 |