基于3行python中可能的字符映射生成所有可能的密码？

Question

我在这个页面上遇到了一个面试问题：(http://newworld-alex.blogspot.com/2009/03/facebook-interviewzz.html)在

Technical question: In python, given a dictionary of character variations for some word, e.g. dictChars = {"e" : [E, 3], "x" : [X], "a" : [A, @], "m" : [M]} implement a password-cracker-like partial string permutation generator, i.e. produce exaM, exAm, exAM, ex@m, .... I implemented a simple 3-line recursive solution in Python.

我有一个用Python编写的解决方案，但我似乎不知道如何像他那样把它变成3行。在

仅供参考，以下是我目前的解决方案：

def allPossiblePasswords(password, mapping):
   if len(password) == 0:
      return [""]
   else:
      next = allPossiblePasswords(password[1:], mapping)
      if password[0] in mapping:
         return [c + n for c in mapping[password[0]] for n in next]
      else:
         return [password[0] + n for n in next]

提前谢谢！在

Answer 1

mapping = {'a': ['A', '@'], 'x': ['X'], 'e': ['E', 3], 'm': ['M']}

password = "exam"

from itertools import product
allPossible = list(product(*([letter] + mapping[letter] for letter in password)))