[python] 判断字符串中出现次数最多的字母

网址:https://py.checkio.org/mission/most-wanted-letter/

我的代码:

import string

def checkio(text):
    
    text = text.lower()
    
    if 0 < len(text) and len(text) <=10**5:
        return max(string.ascii_lowercase, key=text.count)
    #replace this for solution
    else:
        False

if __name__ == '__main__':
    #These "asserts" using only for self-checking and not necessary for auto-testing
    #assert checkio("Hello World!") == "l", "Hello test"
    #assert checkio("How do you do?") == "o", "O is most wanted"
    #assert checkio("One") == "e", "All letter only once."
    #assert checkio("Oops!") == "o", "Don't forget about lower case."
    #assert checkio("AAaooo!!!!") == "a", "Only letters."
    #assert checkio("abe") == "a", "The First."
    #print("Start the long test")
    #assert checkio("a" * 9000 + "b" * 1000) == "a", "Long."
    print("The local tests are done.")

大神的代码;

import string

def checkio(text):
    """
    We iterate through latyn alphabet and count each letter in the text.
    Then 'max' selects the most frequent letter.
    For the case when we have several equal letter,
    'max' selects the first from they.
    """
    text = text.lower()
    return max(string.ascii_lowercase, key=text.count)



  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值