class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode* fastnode = head;
ListNode* slownode = head;
for(int i = 0; i < k-1; i++){
fastnode = fastnode->next;
}
while(fastnode->next){
fastnode = fastnode->next;
slownode = slownode->next;
}
return slownode;
}
};
力扣:链表中倒数第k个节点
最新推荐文章于 2024-07-24 23:49:50 发布