Python | 链表的基础操作||

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
    
class LinkList:
    def __init__(self):
        self.head_node = None
        self.length = 0
    def insert(self, data):
        self.length += 1
        new_node = Node(data)
        if self.head_node is None:
            self.head_node = new_node
            return self.head_node
        else:
            current_node = self.head_node
            while current_node.next is not None:
                current_node = current_node.next
            current_node.next = new_node
            return new_node

            
n, m = map(int, input().split())
datas = list(map(int, input().split()))
my_link_list = LinkList()
for element in datas:
    my_link_list.insert(element)
positions = list(map(int, input().split()))
for position in positions:
    if position < 1 or position > my_link_list.length:     //判断位置是否越界
        print("Output position out of bounds.")
    else:
        current_node = my_link_list.head_node      
        while position > 1:
            current_node = current_node.next
            position -= 1
        print(current_node.data)

python对缩进和符号十分敏感