19. 删除链表的倒数第 N 个结点

简单的快慢指针

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
ListNode* removeNthFromEnd(ListNode* fastnode, int n) {
	if(nullptr==fastnode || 0==n)
		return fastnode;
	ListNode head(-1, fastnode);
	auto slownode = &head;
	fastnode = &head;
	while(n-->0 && nullptr!=fastnode)
		fastnode = fastnode->next;

	while(nullptr!=fastnode->next)
	{
		fastnode=fastnode->next;
		slownode=slownode->next;
	}
	if(nullptr!=slownode && nullptr!=slownode->next)
	slownode->next = slownode->next->next;
	return head.next;
}


};