class Solution { public: ListNode* FindKthToTail(ListNode* pHead, int k) { // write code here ListNode* p = pHead; int cnt = 0; while(p)#这个while循环就是为了求出链表的长度 { cnt++; p = p->next; } ListNode* q = pHead; if...