Study Plan For Algorithms - Part17

1. 链表中倒数第k个节点
输入一个链表，输出该链表中倒数第k个节点。
方法：

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def getKthFromEnd(head, k):
    node_f = head
    node_s = head
    while k and node_s:
        node_s = node_s.next
        k -= 1
    while node_f and node_s:
        node_f = node_f.next
        node_s = node_s.next
    return node_f