【链表】面试题22. 链表中倒数第k个节点

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode* getKthFromEnd(ListNode* head, int k) {
12         if (NULL == head || k <= 0)
13         {
14             return head;
15         }
16 
17         ListNode *cur = head;
18         int num = 1;
19         while (cur != NULL)
20         {
21             cur = cur->next;
22             num++;
23         }
24         
25         //std::cout << num << std::endl;
26         
27         cur = head;
28         for (int i = 1; i < num - k; i++)
29         {
30             // std::cout << i << "\t" << cur->val << std::endl;
31             cur = cur->next;
32 
33         }
34 
35         return cur;
36     }
37 };