题目链接:https://www.nowcoder.com/practice/480caa5ffd164ac8b71caaa6d0f4e6db
暴力遍历判断
s = [c[1:-1] for c in input()[1:-1].split(',')]
def check_same(s1,s2):
for a in s1:
if a in s2:
return True
return False
maxn = 0
for i in range(len(s)):
for j in range(i+1,len(s)):
if not check_same(s[i],s[j]):
maxn = max(maxn,len(s[i])*len(s[j]))
print(maxn)