LeetCode Java First 400 题解-019

最新推荐文章于 2019-11-20 13:08:55 发布

Felomeng

最新推荐文章于 2019-11-20 13:08:55 发布

阅读量243

点赞数

分类专栏：刷题文章标签： LeetCode 双指针

本文链接：https://blog.csdn.net/felomeng/article/details/102811119

版权

刷题专栏收录该内容

34 篇文章 0 订阅

订阅专栏

Remove Nth Node From End of List Medium

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

For example,

   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the linked list becomes 1->2->3->5.

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

public ListNode removeNthFromEnd(ListNode head, int n) {

    if (head.next == null) {

        return null;

    }

    int i = 0;

    ListNode p1 = head, p2 = head;

    while (p1.next != null) {

        p1 = p1.next;

        ++i;

        if (i > n) {

            p2 = p2.next;

        }

    }

    if (i == n - 1) {

        head = head.next;

    } else {

        p2.next = p2.next.next;

    }

    return head;

}