答案:
#链表类的定义
class Linklist:
def __init__(self,val):
self.val = val
self.next = None
def append(self,val):
new = Linklist(val)
while self.next != None:
self = self.next
self.next = new
def display(self):
while self.next != None:
self = self.next
print(self.val,end=" ")
seq = list(map(int,input().split()))
head = Linklist(0)
for num in seq:
head.append(num)
########以上为链表数据的输入head为已知链表
arr = []
p = head
while p.next != None:
arr.append(p.val)
#提取列表中的数据
i = -1
j = len(arr)
cnt = 0#计数器统计删除节点的个数
flag = True
while i<j :
i += 1
j -= 1
if cnt > 1:
flag = False
break
if arr[i] != arr[j]:
if arr[i + 1] == arr[j]:
i += 1
cnt += 1
elif arr[i] == arr[j-1]:
j -= 1
cnt += 1
if flag:
print('True')
else:
print('False')