《leetcode hot100》19. 删除链表的倒数第 N 个结点

gentle coder

于 2024-03-26 20:23:10 发布

阅读量148

点赞数 5

文章标签：链表算法 java

本文链接：https://blog.csdn.net/m0_74969835/article/details/137056528

版权

模拟即可：

Accode:

class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        ListNode list = new ListNode(0, head);
        int length = getLength(head);
        ListNode cur = list;
        for (int i = 1; i <= length - n ; ++i) {
            cur = cur.next;
        }
        cur.next = cur.next.next;
        return  list.next;
    }

    public int getLength(ListNode head) {
        int length = 0;
        while (head != null) {
            ++length;
            head = head.next;
        }
        return length;
    }
}

over~