实现一种算法,找出单向链表中倒数第 k 个节点。返回该节点的值。
示例
输入: 1->2->3->4->5 和 k = 2
输出: 4
解答 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:
n=head;
num=0;
while n!=None:
num=num+1;
n=n.next;
length=num;
n=head;
while n!=None:
num=num-1;
if num==k-1:
return n.val;
n=n.next;