python - 快速检查列表是否是嵌套列表元素之一的子列表

Question

作为 SAT 求解器的结果，我有一个很大的逻辑公式模型嵌套 int 列表。该列表有 100 万个子列表，长度大约为 30。

示例数据:

[[-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, -34, 35, 36, -37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, -34, 35, 36, 37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, 34, 35, 36, -37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, 34, 35, 36, 37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, 34, -35, 36, -37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, -31, 32, 33, 34, -35, 36, 37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, 31, 32, 33, 34, -35, 36, -37], [-1, -2, 3, -4, -5, 6, 7, -8, -9, -10, -11, -12, 13, 14, 15, -16, 17, -18, -19, -20, 21, 22, 23, 24, 25, -26, -27, 28, 29, 30, 31, 32, 33, 34, -35, 36, 37]]

我需要检查一个列表，比如 [4,5,6] 是否包含属于嵌套列表之一的元素。

假设我的列表是:

[ [5,12,46,4,99,6],[23,66,99,32,77] ]

如果我用

运行我的程序

[4,5,6]

它应该返回true

因为我需要用不同的列表执行 500 次测试，所以我想问题是性能关键。

这是我的计划:

• 对列表进行排序以检查
• 对大嵌套列表进行排序
• 始终首先比较两个最小的数字(假设我搜索 2 并且子列表以 3 开头，我可以继续到下一个子列表)

或者是否有更好的方法，例如使用字典？

(PS:因为我只寻找正数，所以我之前问过 this question 以去除所有负数。)

Answer 1

使用集合:

>>> data = [ [5,12,46,4,99,6],[23,66,99,32,77] ]
>>> set_data = [set(s) for s in data]
>>> set_data
[set([99, 4, 5, 6, 12, 46]), set([32, 66, 99, 77, 23])]
>>> myset = set([4,5,6])
>>> [myset.issubset(s) for s in set_data]
[True, False]