/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
int kthToLast(struct ListNode* head, int k){
struct ListNode* slow_p=head,*p=head;
while(k--){
p=p->next;
}
while(p!=NULL){
slow_p=slow_p->next;
p=p->next;
}
return slow_p->val;
}
Leetcode链表5
最新推荐文章于 2024-06-12 13:39:23 发布