LeetCode--LeetCode:Remove Nth Node From End of List（C++）

题目描述：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.

代码实现如下：

/**
 * 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) {
        if(head==NULL || head->next==NULL || n<=0)
            return NULL;

        ListNode* cur=head;
        ListNode* prev=head;

        for(int i=0;i<n;i++)
        {
            cur=cur->next;
        }
        if(cur==NULL)
            return head->next;

        while(cur->next!=NULL)
        {
            cur=cur->next;
            prev=prev->next;
        }

        prev->next=prev->next->next;
        return head;
    }
};