双指针
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode* out=head;
for(int i=0;i<k;i++){
head=head->next;
}
while(head){
out=out->next;
head=head->next;
}
return out;
}
};
顺序查找
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
vector<ListNode*>out;
while(head){
out.push_back(head);
head=head->next;
}
return out[out.size()-k];
}
};