题解 | #链表中倒数最后k个结点#

ListNode* FindKthToTail(ListNode* pHead, int k) {
        // write code here
        //快慢指针
        ListNode *fast=pHead;
        ListNode *slow=pHead;
        //快指针先走k
        for(int i=0;i<k;i++){
           if(fast){
                fast=fast->next;
           }else
               //达不到说明链表过短 注意这里赋值空指针
               slow=nullptr;
        }
        while(fast){
                fast=fast->next;
                slow=slow->next;
            }
        //单一出口
        return slow;
    }