随笔分类 -  Fast&slow Pointer

[Leetcode 19]删除链表中倒数第N个元素Remove Nth Node From End of List
摘要:题目 删除链表head中倒数第N个元素 Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: head = [1,2,3 阅读全文
posted @ 2021-11-23 01:13 alau 阅读(34) 评论(0) 推荐(0)