python链表——找到链表的倒数第k个节点

输入：1->2->3->4->5->6->7， k=3

输出：节点5

思路：

方法1：两次顺序遍历，第一次求得链表长度size，第二次遍历到size-k的位置，cur.next就是对应的节点
方法2：引入两个相隔k个长度的外部变量cur1, cur2，当cur2.next为None时，cur1正好是倒数第k个节点

代码：

def get_data(head, k):
    if head is None:
        print("The link is None")
        return
    size = 0
    cur = head
    while cur:
        size += 1
        cur = cur.next
    if k <= size:
        index = size - k
        cur2 = head
        count = 0
        # 当count=index时跳出循环，index位置对应的是cur2值，k是index下一个值，k对应的是cur2.next值，自己画画图，代入数据会比较形象些
        while count < index:
            count += 1
            cur2 = cur2.next
        return cur2
    else:
        print(k, "is out of index")


def get_data2(head, k):
    if head is None:
        print("The link is None")
        return
    if k <= 0:
        print(k, " is invalid value")
        return
    cur1 = head
    cur2 = head
    count = 1
    try:
        while count < k:
            count += 1
            cur2 = cur2.next
        while cur2.next is not None:
            cur1 = cur1.next
            cur2 = cur2.next
    except AttributeError:
        print(k, "is out of index")
        return
    return cur1

# 测试
link = LinkedList()
print("=========before=============")
link.add(1)
link.add(2)
link.add(3)
link.add(4)
link.add(5)
link.add(6)
link.add(7)
link.print_link()
print("=========get_data=============")
print("get_data(link.head, 3):", get_data(link.head, 3).data)
get_data(link.head, 8)
print("===========get_data2=============")
print("get_data2(link.head, 3):", get_data2(link.head, 3).data)
get_data2(link.head, 8)

# 结果
=========before=============
1
2
3
4
5
6
7
=========get_data=============
get_data(link.head, 3): 5
8 is out of index
===========get_data2=============
get_data2(link.head, 3): 5
8 is out of index