LeetCode-返回倒数第 k 个节点
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */int kthToLast(struct ListNode* head, int k){ struct ListNode* p=head; struct ListNode* q=head; if(k<0){ return 0;









