/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* findKthToTail(ListNode* pListHead, int k) {
vector<ListNode>q;
while(pListHead){
q.push_back(*pListHead);
pListHead=pListHead->next;
}
if(q.size()<k)return NULL;
else return &q[q.size()-k];
}
};
acwing 33. 链表中倒数第k个节点
最新推荐文章于 2022-12-07 22:52:17 发布