(classes)
| 17 | |
| 18 | |
| 19 | def majority_classes(classes): |
| 20 | #返回多数类，返回结果是一个列表，如果有多个类出现的次数相同那就都返回 |
| 21 | classes = [x for x in classes if x != 0] |
| 22 | #如果是空列表，那就返回空的 |
| 23 | if len(classes) == 0: |
| 24 | return [] |
| 25 | |
| 26 | counter = Counter(classes) |
| 27 | |
| 28 | # 获取出现次数最多的key |
| 29 | max_count = max(counter.values()) |
| 30 | most_common_keys = [key for key, count in counter.items() if count == max_count] |
| 31 | |
| 32 | return most_common_keys |
| 33 | |
| 34 | |
| 35 | #计算两个列直接的u_set分数 |
no outgoing calls
no test coverage detected