class Solution:
def minimumString(self, a: str, b: str, c: str) -> str:
def merge(s:str,t:str)->str:
if t in s:return s
if s in t:return t
for i in range(min(len(s),len(t)),0,-1):
if s[-i:]==t[:i]:
return s+t[i:]
return s+t
ans = ""
for a,b,c in permutations((a,b,c)):
s = merge(merge(a,b),c)
if ans=="" or len(s)<len(ans) or len(s)==len(ans) and s<ans:
ans = s
return ans
2800. 包含三个字符串的最短字符串
最新推荐文章于 2024-07-30 17:23:09 发布