[leetcode note] Remove Nth Node From End of List

时间: 2019-12-02 7:59 PM
题目地址: https://leetcode.com/problems/remove-nth-node-from-end-of-list/

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

给定一个链表，从列表末尾删除第n个节点并返回其头。

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.

Follow up:
Could you do this in one pass?

Solution:

public ListNode removeNthFromEnd(ListNode head, int n) {
    ListNode node = head;
    int len = 0;
    while(null != node) {
        ++len;
        node = node.next;
    }
    int destination = len - n;
    ListNode pre = null;
    node = head;
    for (int i = 0 ; i < destination; ++i) {
        pre = node;
        node = node.next;
    }
    if (null == pre) {
        return node.next;
    } else {
        pre.next = node.next;
    }
    return head;
}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Remove Nth Node From End of List.
Memory Usage: 35.1 MB, less than 100.00% of Java online submissions for Remove Nth Node From End of List.

欢迎关注公众号(代码如诗):