https://blog.youkuaiyun.com/forest_long/article/details/125803208
看到一个华为面试题,我有自己不同的思路,地址如上。
while True:
try:
a = input('')
b = list(a)
def quchongfu():
for i, j in enumerate(b):
if i + 1 <= len(b) - 1:
if b[i] == b[i + 1]:
del b[i + 1]
del b[i]
quchongfu()
quchongfu()
print(''.join(b))
except:
break