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?

思路

典型的双指针应用：设置快慢指针fast和slow，先让fast走n步，然后两个指针一起前进。当fast->next == nullptr时，slow->next即为倒数第n个节点。需要注意，当删除第一个节点时的特殊情况。
注意删除不要的节点，否则会内存泄漏。

代码

class Solution {
public:
	ListNode * removeNthFromEnd(ListNode* head, int n) {
		
		ListNode *end = head;
		ListNode *remove = head;
		ListNode *before = head;
		while (n-- > 0) {
			end = end->next;
		}
		if (end == NULL) {
			remove = head;
			head = head->next;
			delete remove;
			return head;
		}

		end = end->next;
		remove = remove->next;
		while (end != NULL) {
	
			end = end->next;
			remove = remove->next;
			before = before->next;
		}
		before->next = remove->next;
		delete remove;
		return head;
	}
};