LeetCode：Remove Nth Node From End of List

LeetCode：Remove Nth Node From End of List

---

1、题目：
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.

类似：寻找倒数第m个元素
http://blog.csdn.net/bestzem/article/details/51765024

---

2、代码：

/**
 * 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 *cur=head,*pre=head,*prep=nullptr;
        //cur遍历，pre为cur前第n个节点,prep则为n+1
        int i=0;
        while(cur)
        {
            if(i<n)
            {
                ++i;
            }
            else
            {
                prep=pre;
                pre=pre->next;
            }
            cur=cur->next;
        }
        if(prep)//prep已经移动
        {
            prep->next=pre->next;

        }
        else//prep未移动
        {
            head=pre->next;
        }
        delete pre;
        return head;
    }
};

---

3、总结：
A、三个指针，cur往后遍历，pre保持为前n个，prep为要删的节点的前驱。
B、先将空链表排除，剩余两种情况，prep为空和不为空。注意为空时的处理，直接将pre->next给head就好了。