结构体链表实现 单向列表 可当模板

class Node:
    def __init__(self,val:int,nxt:int):
        self.val=val
        self.nxt=nxt
def add (it,val):
    a.append(Node(val,a[it].nxt))
    a[it].nxt=len(a)-1
def delete (it):
    a[it].nxt=a[a[it].nxt].nxt
cin=list(map(int,input().split()))
n=len(cin)
m=int(input())
a=[Node(cin[i],i+1) for i in range(n)]
a[n-1].nxt=-1
it=0
f=1
while it!=-1:
    if a[a[it].nxt].val==m:
        delete(it)
        f=0
    it=a[it].nxt
if f:
    print("wrong")
else:
    it=0
    while it!=-1:
        print(a[it].val,end=" ")
        it=a[it].nxt