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

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

给你一个链表，删除链表的倒数第 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]

解法一：先确认链表的长度

/**
 * 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 l1 = new ListNode(0);
        ListNode head1 = head;
        ListNode newHead = l1;
        int i = 0;
        while (head1 != null) {
            head1 = head1.next;
            i++;
        }
        int j = 0;
        while (head != null) {
            int x = head.val;
            if (j != (i - n)) {
                newHead.next = new ListNode(x);
                newHead = newHead.next;
                head = head.next;
                j++;
            } else {
                head = head.next;
                j++;
            }
        }
        return l1.next;
    }

解法一：栈

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        Stack<ListNode> stack = new Stack<ListNode>();
        ListNode l1=new ListNode(0,head);
        ListNode cur=l1;
        while(cur!=null){
            stack.push(cur);
            cur=cur.next;
        }
        for (int i = 1; i <= n; ++i) {
            stack.pop();
        }
        ListNode p=stack.peek();
        p.next=p.next.next;
      
        return l1.next;
    }
}