我甚至不确定我需要哪种算法。让我来描述一下这个问题:
假设我有一个值列表:[1, 3, 3, 8, 19, 23]
我有六个收藏:
A = [1, 2, 3, 3, 4, 5]
B = [10, 12, 13, 14, 19, 23]
C = [1, 2, 3, 8, 19, 20, 21, 24]
D = [3, 5, 6, 8, 10, 12, 13, 14]
E = [20, 21, 22, 23, 24, 25, 26]
F = [25, 26, 26, 27, 29, 30]
我想从集合中挑选出这些值,并尝试从尽可能多的集合中挑选。换句话说,尽管我显然可以从集合A中选择1, 3, 3