题目给你一个链表删除链表的倒数第n个结点并且返回链表的头结点。示例 1输入head [1,2,3,4,5], n 2输出[1,2,3,5]示例 2输入head [1], n 1输出[]示例 3输入head [1,2], n 1输出[1]提示链表中结点的数目为sz1 sz 300 Node.val 1001 n sz进阶你能尝试使用一趟扫描实现吗题解/** * 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,head); ListNode left dummy; ListNode right dummy; while(n 0){ right right.next; n--; } while(right.next ! null){ left left.next; right right.next; } left.next left.next.next; return dummy.next; } }