题目描述

返回倒数第k个节点

代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */

typedef struct ListNode ListNode;
int kthToLast(struct ListNode* head, int k){
    ListNode* t = head;
	while (k--){//t往前走k步
		t = t->next;
	}
	while (t){//head和t同时走，t到结尾，head到目标
		t = t->next;
		head = head->next;
	}
	return head->val;
}