leetcode-Remove Nth Node From End of List

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.
n is always valid

---

解法

要点：1.n的取值判断（已经说明无需考虑）
2.思路：两个指针快慢行走找到所需要删除的点
快指针根据n的取值确定位置
最后慢指针到达的位置即为所需要删除的点
3.边界值的考虑，n=1 或者链表大小时，链表只有一个值 且n=1时

---

Definition for singly-linked list.
struct ListNode {
int val;
ListNode next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode removeNthFromEnd(ListNode* head, int n) {
ListNode* fast = head;
ListNode* slow = head;
ListNode* pre = nullptr;
while(n>1)
{
n-=1;
fast=fast->next;
}
while(fast->next!=NULL)
{
pre=slow;
fast=fast->next;
slow=slow->next;
}
if (pre ==NULL)
return slow->next;
pre->next=slow->next;
delete slow;
return head;
}
};