题目描述
输入一个链表,输出该链表中倒数第k个结点。
使用C/C++实现,代码如下:
/*
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 *pTempHead = NULL;
ListNode *pTempTail = NULL;
if ((NULL == pListHead)||(NULL == pListHead->next)||(0 >= k)){
return NULL;
}
pTempHead = pListHead;
pTempTail = pListHead;
for (int i = 1; i < k; i++){
if (NULL != pTempTail->next){
pTempTail = pTempTail->next;
}
else{
return pTempTail;
}
}
while (NULL != pTempTail->next){
pTempHead = pTempHead->next;
pTempTail = pTempTail->next;
}
return pTempHead;
}
};