链表中倒数第k个结点

https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148atpId=13&tqId=11167&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述

输入一个链表，输出该链表中倒数第k个结点。

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
        ListNode* p1=pListHead;
        while(k--){
            if(p1!=NULL){
                p1=p1->next;
            }else{
                return NULL;
            }
        }
        
        ListNode* p2=pListHead;
        while(p1!=NULL){
            p1=p1->next;
            p2=p2->next;
        }
        return p2;
    }
};