LeetCode | 19. Remove Nth Node From End of List

19. Remove Nth Node From End of List

Description

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.

Solution: (Java)

/**
 * 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 count = 0, index = 1;
        ListNode node = head, node1 = head;
        while (node != null) {
            count++;
            node = node.next;
        }
        if (n == count)
            return head.next;

        while (index < count - n) {
            index++;
            node1 = node1.next;
        }
        node1.next = node1.next.next;
        return head;
    }
}

思路

先遍历一遍算出节点数目（count），然后再遍历到第（count - n）个，修改指针指向再下一个即可。
另外，还有一种所谓的 one pass 的方法，见图：