Python模拟链表

"""
利用类来模拟结点，next存储下一个结点对象，最后一个为None。
链表的算法思想和语言无关，都是一样的思想。
"""
class Node(object):  # 结点类
    def __init__(self, value):
        self.value = value
        self.next = None


# 创建
def create():
    head = Node(None)  # 头结点
    pre = head
    num = int(input('输入结点个数'))
    for i in range(num):
        val = input('内容')
        cur = Node(val)
        pre.next = cur
        pre = cur
    pre.next = None  # 最后一个结点，next为空
    return head


# 输出
def print_Linklist(a):
    p = a.next
    while (p):
        print(p.value)
        p = p.next


def length(a):
    p = a.next
    count = 0
    while (p):
        p = p.next
        count += 1
    return count


# 插入
def insert_node(a, len):
    num = int(input('插入第几个'))
    if num > len + 1 or num < 0:
        return
    p = a
    while (num):  # 找到要插入的结点的前一个
        p = p.next
        num -= 1
    val = input('插入的值')
    q = Node(val)  # 新建一个节点
    q.next = p.next  # 插入
    p.next = q


# 改
def change(a, len):
    num = int(input('改第几个'))
    if num > len + 1 or num < 0:
        return
    p = a
    while (num):
        p = p.next
        num -= 1
    val = input('改的内容')
    p.value = val  # 改value值


# 删除
def remove(a, len):
    num = int(input('删除第几个'))
    if num > len + 1 or num < 0:
        return
    p = a
    while (num - 1):
        p = p.next
        num -= 1
    q = p.next
    p.next = q.next
    del (q)


if __name__ == '__main__':
    a = create()
    len = length(a)
    # print(len)
    insert_node(a, len)
    print_Linklist(a)
    remove(a, len)
    print_Linklist(a)
    change(a, len)
    print_Linklist(a)

链表中倒数第k个结点

题目描述

输入一个链表，输出该链表中倒数第k个结点。

class Solution:
    def FindKthToTail(self, head, k):
        # write code here
         
        if k <= 0 or head == None:
            return None
         
        n = 0       
        p = head       
        while p:
            n = n + 1 #找出链表有多少结点
            p = p.next     
        q = head
        i = 0
        number = n-k   #正数第几个
        if n < k:
            return None
        else:
            while i < number: #找出第n-k个
                i = i + 1
                q = q.next
            return q