题目:
代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode* node1 = head;
ListNode* node2 = head;
while(k--) node2=node2->next; //node2先走k步
while(node2!=NULL) //node2结束后,node1就只剩最后k个节点
{
node1 = node1->next;
node2 = node2->next;
}
return node1;
}
};