LeetCode刷题10-链表-19.删除链表的倒数第N个节点
题目
给你一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
示例1:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
示例2:
输入:head = [1], n = 1
输出:[]
示例3:
输入:head = [1,2], n = 1
输出:[1]
提示:
- 链表中结点的数目为 sz
- 1 <= sz <= 30
- 0 <= Node.val <= 100
- 1 <= n <= sz
代码
方式1(双指针法):
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
if(head == null) {
return head;
}
// 设置空头节点
ListNode dummyNode = new ListNode(-1, head);
ListNode currNode = dummyNode;
ListNode nextNode = currNode.next;
int sz = 0;
// 获取链表长度
while(head != null) {
head = head.next;
sz++;
}
currNode = dummyNode;
for(int i = 0; i <sz - n; i++) {
currNode = currNode.next;
nextNode = nextNode.next;
}
currNode.next = nextNode.next;
return dummyNode.next;
}
}