leetcode 19 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.

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?

给定一个链表，删除其倒数第n个节点，要求只遍历一次链表。由于我们不知道链表的长度，所以无法知道其倒数第n个节点。由此我们想到了快慢指针，我们在前面的博客已经介绍过了快慢指针用来求中间节点（https://blog.csdn.net/happyjume/article/details/85242926），本题快指针比慢指针先走了n步，这样在快指针到达链表结尾时，慢指针即倒数第n个节点的前一个节点位置，代码记录如下：

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        if(head == NULL || n == 0)
			return head;
		ListNode* fast = head, *slow = head;
		while(n-- > 0)
		{
			fast = fast->next;
		}
		if(fast == NULL)
			return head->next;
		while(fast->next)
		{
			fast = fast->next;
			slow = slow->next;
		}
		slow->next = slow->next->next;
		return head;
    }
};