a = 'abcd'
b = 'abcd'
s = 'abcdabcd'
def to_list(s):
s1 = []
for x in s:
s1.append(s)
return s1
flag = True
if len(s) == len(a) + len(b):
if s == (a + b) or s == (b + a):
pass
else:
s1 = to_list(s)
a1 = to_list(a)
b1 = to_list(b)
i = 0
j = 0
k = 0
for x in s1:
if i < len(a1) and j < len(b1) and a1[i] == b1[j] and x == a1[i]:
i += 1
j += 1
k += 1
else:
if i < len(a1) and x == a1[i]:
i += 1
j -= k
k = 0
elif j < len(b1) and x == b1[j]:
j += 1
i -= k
k = 0
else:
flag = False
break
else:
flag = False
print(flag)
python 判断串口是否被占用_python:判断一个字符串S是否由其他两个字符串A,B混合而成(混合时字符顺序不变)...
最新推荐文章于 2023-08-07 18:45:00 发布