/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @param {number} n
* @return {ListNode}
*/
var removeNthFromEnd = function(head, n) {
let originHead = head;
let pHead = head;
let cur = head;
while(n--) {
cur = cur.next;
}
if (cur) {
while(cur.next) {
cur = cur.next;
pHead = pHead.next;
}
}
else {
return originHead.next;
}
pHead.next = pHead.next.next;
return originHead;
};
LeetCode - 19. 删除链表的倒数第N个节点
最新推荐文章于 2024-03-02 00:00:38 发布