【发布时间】:2020-10-27 03:48:03
【问题描述】:
我有一个如下所示的列表:
[[0],
[0, 1, 2],
[2],
[3],
[4],
[5],
[0, 1, 2, 3, 4, 5, 6, 7],
[7],
[8],
[9],
[8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18],
[11],
[11, 12, 13, 14, 15, 16, 17, 18],
[13],
[14],
[14, 15, 16, 17, 18],
[16, 17, 18],
[17],
[17, 18]]
我试图在列表中找到最少数量的项目,当连接时,等于列表的整个范围。在这种情况下,列表的完整范围是这样的:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]
所以在这种情况下,列表列表中的这两项将等于整个范围:
[0]
[0, 1, 2]
[2]
[3]
[4]
[5]
---> [0, 1, 2, 3, 4, 5, 6, 7]
[7]
[8]
[9]
---> [8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]
[11]
[11, 12, 13, 14, 15, 16, 17, 18]
[13]
[14]
[14, 15, 16, 17, 18]
[16, 17, 18]
[17]
[17, 18]
【问题讨论】:
-
不清楚你的最后一个例子代表什么。您能否解释一下您的预期输出是什么?是
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18]吗? -
预期的输出应该是
[[0,1,2,3,4,5,6,7], [8,9,10,11,12,13,14,15,16,17,18]]
标签: python list numpy indexing