我有以下形式的值列表:[0,1]、[0,2]、[1,3]、[2,4]、[3,5]、[4, 6], [5,7], [7,9].
我想遍历从 [0,1] 开始的列表,如果第二个字符(在本例中为 1)等于另一个列表元素的第一个字符 (在这种情况下,这将对应于 [1,3],它将转到 [1,3],然后是 [3,5]、[5, 7] 最后是 [7,9]。此时它将从第二个元素 ([0,2]) 开始并执行相同的操作,最终形成两个列表。
澄清一下,列表本身包含偶数和奇数值,这与我在此处显示的示例不同,因此我无法基于此拆分它。
任何能将我推向正确方向的想法都将不胜感激。
请您参考如下方法:
这是一个递归的解决方案,它尝试尽可能长时间地跟踪项目,同时也考虑到备用的未访问路径:
from collections import defaultdict
def split(items):
# create lookup
lookup = defaultdict(set)
for k, v in items:
lookup[k].add(v)
results = []
while sum(map(len, lookup.values())):
# get first element from remaining items
first_k = min((k for k in lookup if len(lookup[k])))
first = first_k, min(lookup[first_k])
# follow that element
results.append(follow(first, lookup))
return results
def follow(item, lookup):
item_k, item_v = item
lookup[item_k].remove(item_v)
result = [item]
# loop through all follow-up items (if any)
for next_item in sorted(lookup[item_v]):
# recursively follow the follow-up item
result.extend(follow((item_v, next_item), lookup))
return result
像这样使用:
>>> def test(items):
for x in split(items):
print(x)
>>> test([[0,1], [0,2], [1,3], [2,4], [3,5], [4,6], [7,9]])
[(0, 1), (1, 3), (3, 5)]
[(0, 2), (2, 4), (4, 6)]
[(7, 9)]
它忽略已经访问过的项目的路径:
>>> test([[0, 1], [1, 2], [4, 3], [2, 5], [5, 1]])
[(0, 1), (1, 2), (2, 5), (5, 1)]
[(4, 3)]
但是当有多个的时候都是按照顺序来的(排序的,不是原来的顺序):
>>> test([[0, 1], [1, 2], [1, 3], [2, 4], [3, 5]])
[(0, 1), (1, 2), (2, 4), (1, 3), (3, 5)]
它也适用于您的复杂示例:
>>> test([[0, 1], [0, 2], [1, 3], [2, 4], [3, 5], [4, 6], [5, 7], [7, 9], [8, 10], [8, 11], [10, 12], [11, 13], [11, 14], [12, 15], [12, 16], [6, 8], [8, 17]])
[(0, 1), (1, 3), (3, 5), (5, 7), (7, 9)]
[(0, 2), (2, 4), (4, 6), (6, 8), (8, 10), (10, 12), (12, 15), (12, 16), (8, 11), (11, 13), (11, 14), (8, 17)]
