题目
力扣打卡:19. 删除链表的倒数第 N 个结点 | 双指针 🔗
解题思路
思路很简单:用两个指针来确定位置,与位置有关的链表大部分都是和双指针有关。倒数第k个节点,链表的中点,删除倒数第k个节点等等
代码
/**
* Definition for singly-linked list.
* class ListNode {
* val: number
* next: ListNode | null
* constructor(val?: number, next?: ListNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function removeNthFromEnd(head: ListNode | null, n: number): ListNode | null {
let dummy = new ListNode(-1), left = dummy, right = head; // right提前走了一步
dummy.next = head;
while (right !== null && n !== 0) {
right = right.next; // 前进n步
n--;
}
while (right !== null) {
right = right.next;
left = left.next;
}
left.next = left.next.next;
return dummy.next
};