leetCode---Remove Nth Node From End of List

一. 题目：Remove Nth Node From End of List 

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. 

二. 思路分析

思路比较简单，注意题目要求在一趟内完成，也就是只能遍历一次，注意n为链表长度时的特殊情况，具体的做法是设置两个指针slow跟fast。fast指针先移动n步，若此时fast指针为空，则表示要删除的是头节点，此时直接返回head->next即可。如果fast指针不为空，则将两个指针一起移动，直到fast指针指向最后一个节点，令slow->next=slow->next->next即可删除第n个节点。代码如下：

/**
 * 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 *slow = head, *fast = head;
        for(int i = 1; i <= n+1; i++){
            if(fast == NULL) return head->next;
            fast = fast->next;
        }
        
        while(fast != NULL){
            slow = slow->next;
            fast = fast->next;
        }
        
        slow->next = slow->next->next;
        return head;
    }
};