暴力点儿做,把0,1组成的长度一定的序列都给dfs出来,遍历一下,看哪个结果没在nums里,返回。这样做的好处是,如果题目被follow up了,问你全部答案有哪些,这里就可以直接给答案了。
class Solution:
def findDifferentBinaryString(self, nums: List[str]) -> str:
res = []
leng = len(nums[0])
cur = ''
self.dfs(leng, cur, res)
for num in res:
if num not in nums:
return num
def dfs(self, L, cur, res):
if len(cur) == L:
res.append(cur)
return
self.dfs(L, cur + '0', res)
self.dfs(L, cur + '1', res)