19、Remove Nth Node From End of List

最新推荐文章于 2021-04-24 09:07:18 发布

littledou2015

最新推荐文章于 2021-04-24 09:07:18 发布

阅读量393

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/littledouble/article/details/43020467

版权

Leetcode 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

Given a linked list, remove the nth node from the end of list and return its head.

For example,

Given a linked list, remove the nth node from the end of list and return its head.

For example,

Note:
Given n will always be valid.
Try to do this in one pass.

Linked List Two Pointers

ListNode *removeNthFromEnd(ListNode *head, int n) {
        //此题要求比遍历一遍搞定,需要一个指针来指向删除节点的前面节点，对于删除头结点的情况需要特殊考虑, p -> next和q-> next节点的关系需要搞清楚
        ListNode *p = head, *q = head;
        while (n--)
            q = q -> next;
        if (q == NULL)
            return p -> next;
        while (q -> next)
        {
            p = p -> next;
            q = q -> next;
        }
        p -> next = p -> next -> next;
        return head;
    }