【Leecode】207Remove Nth Node From End of List删除倒数第N个结点

/*
1.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个结点，然后返回头结点。
思路一：
定义两个指针，第一个指针从链表的头指针开始遍历向前走k-1；第二个指针保持不动，从第k步开始，第二个指针也开始遍历，两个指针差距k-1个距离,
当第一个指针走到了尾巴节点，第二个指针正好在倒数第k个节点；
时间复杂度为O(链表长度)
参考http://blog.csdn.net/sinat_30440627/article/details/51029208

class Solution {
public:
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        ListNode *p1,*p2,*pre;
        if(head==NULL || n<= 0)
            return NULL;
        p1 = head, p2 = head;
        for(int i=0; i<n-1;i++)
        {
            if(p1->next !=NULL)
                p1 = p1->next;
            else
                return NULL;
        }
        while(p1->next!=NULL)
        {
            p1= p1->next;
            pre = p2;//关键一步：标记倒数第n个节点的前一个节点
            p2=p2->next;
        }
        if(p2 == head){
        //关键判断：如果只有一个节点，倒数第n个就是第一个，删除后链表为空
            head = head->next;
        }
        else{
        pre->next = pre->next->next;
        }
        return head;
     } 

};