对K个不同字符的全排列组成的数组, 面试官从中随机拿走了一个, 剩下的数组作为输入, 请帮忙找出这个被拿走的字符串?

对K个不同字符的全排列组成的数组, 面试官从中随机拿走了一个, 剩下的数组作为输入, 请帮忙找出这个被拿走的字符串?

• 比如[“ABC”, “ACB”, “BAC”, “CAB”, “CBA”] 返回 “BCA”
• 第一行输入整数n，表示给定n个字符串。(n == x!-1,2<=x<=10)
• 以下n行每行输入一个字符串
• 输出全排列缺少的字符串

递归解决：通过率85%

def hasLetters(result, letters, strs, length):
    if len(result) == length:
        if len(set(result)) == length and result not in strs:
            return result
        return None

    for letter in letters:
        temp = result.copy()
        temp.append(letter)
        tempResult = hasLetters(temp, letters, strs, length)
        if tempResult != None:
            return tempResult
    return None


num = int(input())
strs = []
for i in range(num):
    strs.append([var for var in input()])

letters = [var for var in strs[0]]
length = len(letters)


for letter in letters:
    result = []
    result += letter

    result = hasLetters(result, letters, strs, length)
    if result != None:
        break

print(''.join(result))