用最少的列表产生最独特的元素

Question

我是新来的。希望能在下面举例说明一下。

example1: What is your name?
example1: Where are you from?
example1: How are you doing?
example2: What is your name?
example2: Where are you from?
example2: How are you doing?
example2: When did you move here?
example9: What is your name?
example3: Where are you from?
example23: Who gave you this book?

在上面的例子中，我想通过考虑例子的数量来打印独特的问题。所以尝试类似

预期输出

 example2: What is your name?
 example2: Where are you from?
 example2: How are you doing?
 example2: When did you move here?
 example23: Who gave you this book?

在这里，我通过考虑较少的示例来搜索文件中的独特问题。

我玩弄了一些东西并将它放在下面。

import collections 
s = collections.defaultdict(list)
u_s = set()
with open ('file.txt', 'r') as s1:
    for line in s1:
        data = line.split(':', maxsplit=1)
        start = data[0]
        end = data[-1]
        if end not in u_s:
            u_s.add(end)
            s[start] += [end]
   for start, ends in s.items():
       print(start, ends[0])

       for end in ends[1:]:
           print(start, end)

我得到的结果：

   example1  What is your name?
   example1  Where are you from?
   example1  How are you doing?
   example2  When did you move here?
   example23  Who gave you this book?

在这里，我不想打印 example1，而是想考虑 example2，因为它提供了更多问题。

我尝试根据行的重复对行进行排序。我无法通过它。我感谢您的帮助。谢谢

Answer 1

您的代码实现的是打印所有独特的问题，但不能比较或打印整个集合。

除了排序之外，我会将问题表述为比较示例集的组合，并选择包含最独特问题和最少集的问题，所以你的问题对我来说更多是关于算法的。

import collections


def calculate_contrib(values, set):
    '''To calculate the contribution on the unique questions' number, based on values to add.
    values: the list of question set to choose.
    set: the already-added question set.'''
    contrib = 0
    for value in values:
        if value not in set:
            contrib += 1
    return contrib


def print_result(x):
    '''To print the result, x, as a dictionary, without repetition.'''
    u_s = set()
    for key, values in x.items():
        for value in values:
            if value not in u_s:
                print(key,value)
                u_s.add(value)


s = collections.defaultdict(list)
# get all questions in examples
with open('file.txt', 'r') as s1:
    for line in s1:
        data = line.split(':', maxsplit=1)
        start = data[0]
        end = data[-1]
        s[start] += [end]

# Get the initial contribution on the unique questions' number for each example set
contrib = dict()
u_s = set()
result = dict()
for key,values in s.items():
    contrib.update({key: calculate_contrib(s[key], u_s)})

# Execute the while loop when there are unique questions to add to u_s
while not(all([x == 0 for x in contrib.values()])):
    # Add the example set with maximum contribution
    max_contrib = 0
    max_key = ""
    for key, value in contrib.items():
        if max_contrib < value:
            max_key = key
            max_contrib = value
    result.update({max_key: s[max_key]})
    u_s.update(s[max_key])
    del s[max_key]
    del contrib[max_key]
    for key, values in s.items():
        contrib[key] = calculate_contrib(values, u_s)

# print the result
print_result(result)

上面是一个简单的实现，即每次添加唯一数增加最多的示例集，直到没有唯一问题。

可以进行进一步的改进。希望它能给你一些见解。