数组与链表
数组
访问元素所用的时间复杂度是 O(1)
插入和删除元素所用的时间复杂度是O(n)
链表
时间复杂度
- 插入O(1)
- 删除O(1)
- 查找O(n)
习题:
https://leetcode.com/problems/reverse-linked-list/
https://leetcode.com/problems/swap-nodes-in-pairs
https://leetcode.com/problems/linked-list-cycle
https://leetcode.com/problems/linked-list-cycle-ii
https://leetcode.com/problems/reverse-nodes-in-k-group/