Leetcode刷题笔记(c++)

class Solution {
public:
    ListNode* getKthFromEnd(ListNode* head, int k) {
        ListNode* out=head;
        for(int i=0;i
            head=head->next;
        }
        while(head){
            out=out->next;
            head=head->next;
        }
        return out;
    }
};

class Solution {
public:
    ListNode* getKthFromEnd(ListNode* head, int k) {
        vectorout;
        while(head){
            out.push_back(head);
            head=head->next;
        }
        return out[out.size()-k];
    }
};