AcWing 826. 单链表-PYTHON3
原题链接
简单
作者:
ATTACK_
,
2023-03-28 12:52:07
,
所有人可见
,
阅读 119
e = [0]*100000
ne = [0]*100000
head = -1
num = 0
def hinsert(item):
global head,num
e[num] = item
ne[num] = head
head = num
num += 1
def iinsert(k,item):
global head,num
e[num] = item
ne[num] = ne[k]
ne[k] = num
num += 1
def ddel(k):
global head,num
if k == 0:
head = ne[head]
return
ne[k-1] = ne[ne[k-1]]
def show():
global head,num
cur = head
while(True):
if ne[cur] == -1:
print(e[cur],end = ' ')
break
else:
print(e[cur],end = ' ')
cur = ne[cur]
n = int(input())
for i in range(n):
row = input().split()
if row[0] == 'H':
hinsert(int(row[1]))
elif row[0] == 'D':
ddel(int(row[1]))
elif row[0] == 'I':
iinsert(int(row[1]) - 1,int((row[2])))
show()