删除链表的倒数第 N 个结点 · 交互式算法学习

这是一组同题正确实现，独立于上方当前动画方法；不同语言可能采用另一种正确策略。

1/**2 * Definition for singly-linked list.3 * public class ListNode {4 *     int val;5 *     ListNode next;6 *     ListNode() {}7 *     ListNode(int val) { this.val = val; }8 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }9 * }10 */11class Solution {12    public ListNode removeNthFromEnd(ListNode head, int n) {13        ListNode dummy = new ListNode(0, head);14        ListNode fast = dummy, slow = dummy;15        while (n-- > 0) {16            fast = fast.next;17        }18        while (fast.next != null) {19            slow = slow.next;20            fast = fast.next;21        }22        slow.next = slow.next.next;23        return dummy.next;24    }25}