剑指 Offer II 021. 删除链表的倒数第 n 个结点:
题目链接 :删除链表的倒数第 n 个结点
题目:给定一个链表,删除链表的倒数第 n 个结点,并且返回链表的头结点。
思路:
1、简单的快慢指针
AC代码:
/**
* 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) {
ListNode dummy=new ListNode(0);
dummy.next=head;
ListNode fast=dummy;
ListNode slow=dummy;
for(int i=0;i<=n;i++)
{
fast=fast.next;
}
while(fast!=null)
{
fast=fast.next;
slow=slow.next;
}
slow.next=slow.next.next;
return dummy.next;
}
}