Commit db6d82d

committed

Deploying to main from @ 0567d31 🚀

1 parent 409a8d0 commit db6d82dCopy full SHA for db6d82d

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -491,9 +491,9 @@ console.log(linkedList.count()); // output: 3`
`491`	`491`
`492`	`492`	`\| 时间复杂度 \| 链表 \| 数组 \|`
`493`	`493`	`\| :--------: \| :----: \| :----: \|`
`494`		-\| 插入 \| `O(n)` \| `O(1)` \|
`495`		-\| 删除 \| `O(n)` \| `O(1)` \|
`496`		-\| 随机访问 \| `O(1)` \| `O(n)` \|
	`494`	+\| 插入 \| `O(1)` \| `O(n)` \|
	`495`	+\| 删除 \| `O(1)` \| `O(n)` \|
	`496`	+\| 随机访问 \| `O(n)` \| `O(1)` \|
`497`	`497`
`498`	`498`	`不过数组和链表的性能对比,并不能局限于时间复杂度。在实际的软件开发中,不能仅仅利用复杂度分析就决定使用哪个数据结构来存储数据。`
`499`	`499`

Comments

(0)