列出最多重复字符的字符串的所有可能排列

def find_max_repeated_permutations(s):
    char_counts = {}
    max_count = 0

    # 统计字符出现次数
    for char in s:
        char_counts[char] = char_counts.get(char, 0) + 1
        max_count = max(max_count, char_counts[char])

    result = []
    generate_permutations("", char_counts, result, max_count)
    return result

def generate_permutations(prefix, counts, result, max_count):
    if not counts:
        result.append(prefix)
        return

    for char in counts:
        if counts[char] == max_count:
            counts[char] -= 1
            generate_permutations(prefix + char, counts, result, max_count)
            counts[char] += 1

# 测试示例
s = "aabbc"
result = find_max_repeated_permutations(s)
print(result)