python中的Counter类总结

代码

from collections import Counter
a = [1, 4, 3, 2, 3, 6, 7, 4, 3]
b = [4, 5, 4, 2, 7, 4, 3]
dic_a = Counter(a)
dic_b = Counter(b)
print("dic_a", dic_a)
# 删除某个key
del dic_a[6]
# 输出value最大的前n个 输出的是列表里面套元组
print(dic_a.most_common(2))
# 得到key对应的value 直接dic_a[3]不就行了么 感觉这个函数略显多余？
print(dic_a.get(3))
print(dic_a.items())
print(dic_a.keys())
print(dic_a.values())
print(dic_a.pop(7))
# Counter类没有fromkeys
c = {}
print(c.fromkeys([1, 7], "1"))
# 对dic_a更新 括号里面需要是可迭代对象
dic_a.update([9, 9, 9])
# 按value值从大到小排序
print("dic_a", dic_a)
print("dic_b", dic_b)
# 只保留value大于0的key-value对
print("dic_a - dic_b", dic_a - dic_b)
print("dic_a + dic_b", dic_a + dic_b)
# 并集 如果key在两个里面都有 就保存value大的
print("dic_a | dic_b", dic_a | dic_b)
# 交集 如果key在两个里面都有 就保存value小的
print("dic_a & dic_b", dic_a & dic_b)
# 正负数还有0都会保存
dic_a.subtract(dic_b)
print("a.subtract", dic_a)

结果