题目描述
输入一个链表,输出该链表中倒数第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* node;
int total = 0;
ListNode* p = pListHead;
while (p != NULL)
{
total++;
p = p->next;
}
if (k > total) {
return p;
}
int j = 0;
while (pListHead != NULL)
{
j++;
if (j == total - k+1) {
node = pListHead;
break;
}
pListHead = pListHead->next;
}
return node;
}
};
网友评论