BM9 删除链表的倒数第n个节点 C++

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param head ListNode类 
     * @param n int整型 
     * @return ListNode类
     */
    ListNode* removeNthFromEnd(ListNode* head, int n) {
        // write code here
        vector<ListNode*> list;
        //ListNode* dummyNode;
        //dummyNode->next = head;
        ListNode* cur = head;
        //删除倒数第k个结点
        while(cur != NULL)
        {
            list.push_back(cur);
            cur = cur->next;
        }
        int len = list.size();
        if(n == len)
        {
            return list[1];
        }
        if(n == 1)
        {
            list[len-2]->next = list[len-1]->next;
            return list[0];
        }
        list[len-n-1]->next = list[len-n]->next;
        return list[0];
    }
};