题目描述
AC代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
//建立虚拟头节点,因为需要考虑删除的节点是头节点的情况
ListNode dummy=new ListNode(-1);
dummy.next=head;
//采用双指针算法
ListNode first=dummy,second=dummy;
while(n>0){
n--;
first=first.next;
}
while(first.next!=null){
first=first.next;
second=second.next;
}
second.next=second.next.next;
return dummy.next;
}
}