您想要的关键字母组合的集合A
, J
, and K
被称为笛卡尔积。
在Python中,你可以使用itertools.product来生成它们。
首先,我们需要找到输入字符串中所有关键字母的位置。最简单的方法是使用内置的enumerate功能。一旦我知道这些位置以及字符串包含多少个关键字母,我们就可以生成笛卡尔积的每一项,替换关键字母,并打印新字符串。
在 Python 中,字符串是不可变的(它们无法更改),因此我将字符串转换为字符列表,替换关键位置中的字符,然后使用str.join
method.
以下代码适用于 Python 2 和 3 版本
Python
from itertools import product
def make_patterns(s):
keyletters = 'AJK'
# Convert input string into a list so we can easily substitute letters
seq = list(s)
# Find indices of key letters in seq
indices = [ i for i, c in enumerate(seq) if c in keyletters ]
# Generate key letter combinations & place them into the list
for t in product(keyletters, repeat=len(indices)):
for i, c in zip(indices, t):
seq[i] = c
print(''.join(seq))
# Test
data = (
'1ABC2',
'27AAGCB5913L2ZF',
'3A4J',
'5K67KA',
)
for s in data:
print('\nInput:', s)
make_patterns(s)
output
Input: 1ABC2
1ABC2
1JBC2
1KBC2
Input: 27AAGCB5913L2ZF
27AAGCB5913L2ZF
27AJGCB5913L2ZF
27AKGCB5913L2ZF
27JAGCB5913L2ZF
27JJGCB5913L2ZF
27JKGCB5913L2ZF
27KAGCB5913L2ZF
27KJGCB5913L2ZF
27KKGCB5913L2ZF
Input: 3A4J
3A4A
3A4J
3A4K
3J4A
3J4J
3J4K
3K4A
3K4J
3K4K
Input: 5K67KA
5A67AA
5A67AJ
5A67AK
5A67JA
5A67JJ
5A67JK
5A67KA
5A67KJ
5A67KK
5J67AA
5J67AJ
5J67AK
5J67JA
5J67JJ
5J67JK
5J67KA
5J67KJ
5J67KK
5K67AA
5K67AJ
5K67AK
5K67JA
5K67JJ
5K67JK
5K67KA
5K67KJ
5K67KK
通过微小的改变,我们可以将我们的函数变成一个生成器。这使您可以轻松地循环输出字符串,或者根据需要将它们转换为列表。
Python
from itertools import product
def make_patterns(s):
keyletters = 'AJK'
# Convert input string into a list so we can easily substitute letters
seq = list(s)
# Find indices of key letters in seq
indices = [i for i, c in enumerate(seq) if c in keyletters]
# Generate key letter combinations & place them into the list
for t in product(keyletters, repeat=len(indices)):
for i, c in zip(indices, t):
seq[i] = c
yield ''.join(seq)
# Test
print(list(make_patterns('A12K')))
for s in make_patterns('3KJ4'):
print(s)
output
['A12A', 'A12J', 'A12K', 'J12A', 'J12J', 'J12K', 'K12A', 'K12J', 'K12K']
3AA4
3AJ4
3AK4
3JA4
3JJ4
3JK4
3KA4
3KJ4
3KK4