刷点面试小题

【1】输出文本中出现的字符串的频率最多的字符串

方法一:使用collections中的Counter模块进行统计

from collections import Counter

with open("word", 'r') as f:
    text = f.read()
    f.close()
    word_list = text.split()

count = Counter(word_list)
print count

count_max = max(count.values())

big_list = []

for k, v in count.items():
    if v == count_max:
        big_list.append(k)

print big_list

方法二:使用列表和集合处理进行统计

with open("word", 'r') as f:
    text = f.read()
    f.close()
    word_list = text.split()

new_list = []
word_set = set(word_list)
for i in word_set:
    new_list.append(word_list.count(i))
print new_list

big_list = []
count_max = max(new_list)
for i in range(len(new_list)):
    if new_list[i] == count_max:
        big_list.append(list(word_set)[i])
print big_list

方法三:用字典处理进行统计

with open("word", 'r') as f:
    text = f.read()
    f.close()
    word_list = text.split()

dict = {}
big_list = []
for i in word_list:
    count = 0
    if i not in dict.keys():
        dict[i] = count + 1
    else:
        dict[i] = dict[i] + 1
print dict

count_max = max(dict.values())
for k,v in dict.items():
    if v == count_max:
        big_list.append(k)
print big_list

三种方法都是可以的。

 

 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值