题目描述
输入一个链表,输出该链表中倒数第k个结点。
struct ListNode {
3
int val;
4
struct ListNode *next;
5
ListNode(int x) :
6
val(x), next(NULL) {
7
}
8
};*/
9
class Solution {
10
public:
11
ListNode* FindKthToTail(ListNode* pListHead, unsigned int k)
12
{
13
ListNode* p = pListHead;
14
int len = 0;
15
while(p != NULL)
16
{
17
p = p->next;
18
len++;
19
}
20
int count = len - k;
21
for(int i = 0;i < len;i++)
22
{
23
if(i == count)
24
{
25
break;
26
}
27
28
pListHead = pListHead->next;
29
}
30
return pListHead;
31
}
32
};