LeetCode 19. Remove Nth Node From End of List（链表）

题目来源：https://leetcode.com/problems/remove-nth-node-from-end-of-list/submissions/

问题描述

19. Remove Nth Node From End of List

Medium

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

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.

------------------------------------------------------------

题意

给出一个单向链表和整数n，删除倒数第n个数。

------------------------------------------------------------

思路

由于单向链表只能从头遍历，因此需要遍历两遍链表：

1. 第一遍计算链表总长度L；

2. 第二遍删除从头数第(L+1-n)个节点。

具体实现方面，Java语言因为有GC，不用手动释放被删除的节点的内存，因此代码相较于C++版要简单一些。

------------------------------------------------------------

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode removeNthFromEnd(ListNode head, int n) {
        int l = 0, i = 0;
        ListNode pointer = head, succeed = head;
        while (pointer != null)
        {
            l++;
            pointer = pointer.next;
        }
        if (l == n)
        {
            return head.next;
        }
        pointer = head;
        while (pointer != null)
        {
            i++;
            if (i == l - n)
            {
                succeed = pointer.next;
                pointer.next = succeed.next;
                break;
            }
            pointer = pointer.next;
        }
        return head;
    }
}