题解 | #删除链表的倒数第n个节点#

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param head ListNode类 
     * @param n int整型 
     * @return ListNode类
     */
    public ListNode removeNthFromEnd (ListNode head, int n) {
        // write code here
        if(head == null ){
            return null;
        }
        ListNode slow = head;
        ListNode fast = head;
        int i = n;
        while(fast != null && i > 0){
            fast = fast.next;
            i --;
        }
        if(fast == null){
            return head.next;
        }
        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next;
        }
        slow.next = slow.next.next;
        
        return head;
    }
}