/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} n
* @return {ListNode}
*/
var removeNthFromEnd = function(head, n) {
if(head == null) return null
if(head.next == null) return null
var dummy = new ListNode(0,head)//定义哑巴节点
// let newHead = head
let left = dummy
let right = dummy
for(let i = 0;i<n;i++){//快指针先走n步
right = right.next
}
while(right.next){//这样写避免找不到
right = right.next
left = left.next
}
left.next = left.next.next
return dummy.next//返回哑巴节点的下一个节点,因为这样可以避免处理头节点
};
删除链表的倒数第n个节点
最新推荐文章于 2024-09-21 10:02:17 发布