Python - 矩阵中最常见的组合

pythonserver side programmingprogramming更新于 2025/10/29 7:40:17

当需要找到矩阵中最常见的组合时，可以使用简单的迭代以及‘sort’方法和‘Counter’方法。

示例

下面是相同的演示

from collections import Counter
from itertools import combinations

my_list = [[31, 25, 77, 82], [96, 15, 23, 32]]

print("列表为:")
print(my_list)

my_result = Counter()

for elem in my_list:
   if len(elem) < 2:
      continue

   elem.sort()

   for size in range(2, len(elem) + 1):
      for comb in combinations(elem, size):
         my_result[comb] += 1

my_result = [elem for elem, my_count in my_result.items() if my_count ==
my_result.most_common(1)[0][1]]

print("结果为:")
print(my_result)

输出

列表为:
[[31, 25, 77, 82], [96, 15, 23, 32]]
结果为:
[(15, 23, 32, 96), (25, 31), (25, 82), (15, 32), (23, 32), (15, 32, 96), (25, 31, 82), (15, 23), (25, 77), (15, 23, 32), (25, 77, 82), (32, 96), (31, 77, 82), (15, 96), (31, 77), (23, 96), (25, 31, 77, 82), (31, 82), (77, 82), (23, 32, 96), (15, 23, 96), (25, 31, 77)]