如何用Python获取字符串的多个最频繁k-mer？代码异常调试求助

Fixed Code #

print("Insert the Text:")
Text = input().strip()
print("Insert a value for k:")
k = int(input())

def FrequentWords(Text, k):
    # Use a dictionary to map each k-mer to its occurrence count
    pattern_counts = {}
    # Iterate through all possible k-mers in the input text
    for i in range(len(Text) - k + 1):
        pattern = Text[i:i+k]
        if pattern in pattern_counts:
            pattern_counts[pattern] += 1
        else:
            pattern_counts[pattern] = 1
    
    # Find the highest frequency count
    max_count = max(pattern_counts.values())
    # Collect every k-mer that matches this maximum count
    frequent_patterns = [pattern for pattern, count in pattern_counts.items() if count == max_count]
    
    return frequent_patterns

# Execute the function and print the result
result = FrequentWords(Text, k)
print(result)

What Was Wrong with the Original Code? #

Let's break down the key issues in your initial implementation:

1. Variable Name Collision
   You used the same variable i for both the outer and inner loops. When the inner loop runs, it overwrites the value of i from the outer loop. By the time you reach the check for max count, i is set to the last index of the inner loop—so you only ever evaluate the very last k-mer (CA in your test case).

2. No Pattern-Count Mapping
   Your count list stores all occurrence counts, but you don't track which count belongs to which k-mer. This makes it impossible to correctly pair counts with their corresponding patterns later on.

3. Single Pass for Frequent Patterns
   The logic to add patterns to FrequentPatterns only runs once, after all loops finish. It doesn't iterate through all k-mers and their counts to collect every pattern that has the maximum frequency.

Why the Fixed Code Works #

• Dictionary for Efficient Tracking: Using a dictionary lets us directly associate each k-mer with its count, which is both intuitive and improves performance (we avoid nested loops, dropping from O(n²) to O(n) time complexity).
• No Variable Conflicts: We use a single loop to iterate through k-mers, eliminating the risk of overwriting loop variables.
• Comprehensive Pattern Collection: We first find the highest frequency value, then filter the dictionary to grab every k-mer that matches this value—ensuring we don't miss any frequent patterns.

Testing this with your input ACACACA and k=2 will return the correct result: ['AC', 'CA'].

内容的提问来源于stack exchange，提问作者Noob