输入一个链表,输出链表中倒数第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) {
if(pListHead==NULL)
return NULL;
ListNode head(-1);
head.next = pListHead;
int length = 0;
while(pListHead!=NULL)
{
length++;
pListHead = pListHead->next;
}
if(k>length)
return NULL;
pListHead = head.next;
for(int i=0; i<(length-k); i++)
pListHead = pListHead->next;
return pListHead;
}
};