一、题目
二、代码
/**
* 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.next==null) return null;
ListNode false_node = new ListNode(0);
ListNode slow = false_node;
ListNode fast = false_node;
false_node.next = head;
int i = 0;
while(i<n)
{
System.out.println("进入1");
fast =fast.next;
i++;
}
fast =fast.next;
while(fast!=null)
{
System.out.println("进入2");
fast = fast.next;
slow = slow.next;
}
slow.next = slow.next.next;
return false_node.next;
}
}