删除链表的倒数第 N 个结点

/**

* 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; }

* }

*/

public ListNode removeNthFromEnd(ListNode head, int n) {

//定义伪头节点

ListNode dummy = new ListNode(0, head);

int length = 0;

ListNode node = dummy;

while(head != null) {

++length;

head = head.next;

}

for(int i=1;i<length-n+1;++i){

node=node.next;

}

node.next = node.next.next;

ListNode ans = dummy.next;

return ans;

}