# LeetCode 19 — Remove Nth Node From End of List（C++ Java Python）

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.

给定链表：1->2->3->4->5，n = 2。
删除倒数第2个节点之后，该链表变为1->2->3->5。

采用快慢指针的思想，间隔n，当快指针到达尾部时，慢指针的下一个结点即为要删除的结点。注意考虑边界情况。

C++实现：

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *removeNthFromEnd(ListNode *head, int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.

for(int i = 0; i < n; ++i)
{
fast = fast->next;
}

if(fast != NULL)
{
while(fast->next != NULL)
{
fast = fast->next;
slow = slow->next;
}

ListNode *tmp = slow->next;
slow->next = tmp->next;
delete tmp;

}
else
{
delete tmp;

}
}
};
Java实现：
/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) {
*         val = x;
*         next = null;
*     }
* }
*/
public class Solution {
public ListNode removeNthFromEnd(ListNode head, int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.

for (int i = 0; i < n; ++i) {
fast = fast.next;
}

if (fast != null) {
while (fast.next != null) {
fast = fast.next;
slow = slow.next;
}
slow.next = slow.next.next;

} else {
}
}
}
Python实现：
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
# @return a ListNode

for i in range(n):
fast = fast.next

if fast != None:
while fast.next != None:
fast = fast.next
slow = slow.next

slow.next = slow.next.next

return head.next