题目:
解法:双指针,先让一根指针走n+1步,再两根指针同时走直到快的指针指向null,慢的指针的next指向后面的后面那个元素。
/**
* 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 pre=new ListNode(0);
pre.next=head;
if(head==null) return null;
ListNode slow=pre;
ListNode fast=pre;
for(int i=1;i<=n+1;i++){
fast=fast.next;
}
while(fast!=null){
slow=slow.next;
fast=fast.next;
}
slow.next=slow.next.next;
return pre.next;
}
}