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

给定一个链表，删除链表的倒数第 n 个节点，并且返回链表的头结点。
示例：
给定一个链表: 1->2->3->4->5, 和 n = 2.
当删除了倒数第二个节点后，链表变为 1->2->3->5.
说明：给定的 n 保证是有效的。
1.Java
法1：两次遍历

public ListNode removeNthFromEnd(ListNode head, int n) {
    ListNode dummy = new ListNode(0);
    dummy.next = head;
    int length  = 0;
    ListNode first = head;
    while (first != null) {
        length++;
        first = first.next;
    }
    length -= n;
    first = dummy;
    while (length > 0) {
        length--;
        first = first.next;
    }
    first.next = first.next.next;
    return dummy.next;
}

法2：一次遍历

public ListNode removeNthFromEnd(ListNode head, int n) {
    ListNode dummy = new ListNode(0);
    dummy.next = head;
    ListNode first = dummy;
    ListNode second = dummy;
    // Advances first pointer so that the gap between first and second is n nodes apart
    for (int i = 1; i <= n + 1; i++) {
        first = first.next;
    }
    // Move first to the end, maintaining the gap
    while (first != null) {
        first = first.next;
        second = second.next;
    }
    second.next = second.next.next;
    return dummy.next;
}

2.C#
在递归回归过程中删除。
1 设置变量max（从1开始），用于记录最大链表的长度，每次递归时，max+=1
2 回归阶段
判断当前的位置是否等于为要删除的节点的next，是将其赋值给全局变量nextNode，判断当前的位置是否等于为要删除的节点的上一个，是将其next赋值为nextNode
3 结束时，判断删除的是否为头节点，是返回头节点的next

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    private  int max = 1;
    private  int target = 0;
    private  ListNode nextNode;


    public ListNode RemoveNthFromEnd(ListNode head, int n) {
          max = 1;
            target = n;
            Dfs(head);
            if (max - target == 0)
            {
                return head.next;
            }
            return head;

    }

    public void Dfs(ListNode head)
    {
        var cur = max;

        if (head.next != null)
        {
            max += 1;
            Dfs(head.next);
        }

        if (cur == max - target + 2)
        {
            nextNode = head;
        }

        if (cur == max - target)
        {
            head.next = nextNode;
        }
    }
}