LinkedList随机删除和插入的效率应该是比较高的 #5
Merged
Conversation
This file contains hidden or 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
LinkedList随机删除和插入的效率应该是比较高的，只是进行指针的操作，相比于ArrayList拷贝数组的操作效率高不少。
|
LinkedList在JDK1.7以后取消了循环而改为双向链表，它的插入操作和删除仅仅做了指针的修改。所以效率应该是很高的。 |
|
不好意思 哪里我打错了 笔误 |
Snailclimb
pushed a commit
that referenced
this pull request
Oct 25, 2019
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
LinkedList随机删除和插入的效率应该是比较高的，只是进行指针的操作，相比于ArrayList拷贝数组的操作效率高不少。