返回倒数第 k 个节点
题目
https://leetcode-cn.com/problems/kth-node-from-end-of-list-lcci
实现一种算法,找出单向链表中倒数第 k 个节点。返回该节点的值。
注意:本题相对原题稍作改动
示例:
输入: 1->2->3->4->5 和 k = 2
输出: 4
说明:给定的 k 保证是有效的。
方法1: 使用栈弹出k个
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
#define N 1000
int kthToLast(struct ListNode* head, int k){
struct ListNode* stack[N];
int top = 0;
while(head) {
stack[top++] = head;
head = head->next;
}
while(--k) {
top--;
}
return (stack[top-1])->val;
}
方法2:双指针
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
int kthToLast(struct ListNode* head, int k){
struct ListNode* t = head;
while (k--) {
t = t->next;
}
while (t) {
t = t->next;
head = head->next;
}
return head->val;
}
方法3:hash直接查找
#define N 1000
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
int kthToLast(struct ListNode* head, int k){
int a[N] = {0}, count = 0;
while(head) {
a[count++] = head->val;
head = head->next;
}
return a[count-k];
}