时间复杂度:
look up o(n)insert o(1)delete o(1)append o(1)prepend o(1)
leetcode:https://leetcode-cn.com/problems/reverse-linked-list/https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
【2022-1-2】算法修炼
最新推荐文章于 2023-05-30 09:55:27 发布
时间复杂度:
look up o(n)insert o(1)delete o(1)append o(1)prepend o(1)
leetcode:https://leetcode-cn.com/problems/reverse-linked-list/https://leetcode-cn.com/problems/reverse-nodes-in-k-group/