如果您看到这个问题的副本,请随意链接它,因为我以前没有看到这个问题。
对于面试问题,我有以下内容:
1) Generate all anagrams of a string
Ex. anagrams("dog") -> ["dog","dgo","odg","ogd","gdo","god"]
2) Generate all k-size anagrams of a string
Ex. anagrams("dog",k = 2) -> ["do","od","dg","gd","go","og"]
我通过递归输入字符串减去它的第一个字符,并将第一个字符插入每个返回的字谜的每个位置,提出了 (1) 的解决方案:
def anagrams(word):
if len(word) == 1:
return [word]
current = word[0]
anags = []
for anag in anagrams(word[1:]):
anags += [anag[:i] + current + anag[i:] for i in range(len(anag) + 1)]
return anags
谁能为 (2) 的签名 def anagrams(word, k = None)
提出 Java 或 Python 解决方案?或在 Java 中 List<String> anagrams(String word, int k)
?
最佳答案
我相信这是正确的解决方案:
from itertools import permutations
def anagrams(word, k=None):
return [''.join(p) for p in permutations(word, k)]
关于java - 生成字符串的所有 k 大小的字谜,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/32728184/