题解 | #链表中倒数第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* re=pListHead;
		ListNode* pre=pListHead;
		if (pListHead==nullptr) {
			return nullptr;
		}
		while (k-->0) {
			if (pre!=nullptr) {
				pre=pre->next;
			}
			else {
				return nullptr;
			}
		}
		while (pre!=nullptr) {
			pre=pre->next;
			re=re->next;
		}
		return re;
    }
};