难度简单33收藏分享切换为英文关注反馈
实现一种算法,找出单向链表中倒数第 k 个节点。返回该节点的值。
注意:本题相对原题稍作改动
示例:
输入: 1->2->3->4->5 和 k = 2
输出: 4
说明:
给定的 k 保证是有效的。
python3
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def kthToLast(self, head: ListNode, k: int) -> int:
jiedian = []
while(head):
jiedian.append(head.val)
head=head.next
return jiedian[-k]
c++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int kthToLast(ListNode* head, int k) {
ListNode* fast = head;
ListNode* slow = head;
int fastStep = 0;
while(fast!=NULL){
if (fastStep>=k){
slow = slow->next;
}
fast = fast->next;
fastStep++;
}
return slow->val;
}
};
//利用快慢指针来获取倒数K的指针的值