lintcode 2.尾部的零

class Solution:
    """
    @param: n: An integer
    @return: An integer, denote the number of trailing zeros in n!
    """
    def trailingZeros(self, n):
        # write your code here, try to do it without arithmetic operators.
        m=1
        q=0
        l=0
        if n<5:
            return 0
        else:
            for i in range(1, n+1):
                m = m*i
            while l==0:
                l=m%10
                m=m/10
                q=q+1
            return q-1
'''
由于超过25数字过大,导致改为科学计数法,导致出错
'''
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

 
class Solution:
    """
    @param: n: An integer
    @return: An integer, denote the number of trailing zeros in n!
    """
    def trailingZeros(self, n):
        # write your code here, try to do it without arithmetic operators.
        m=1
        num=0
        
        for i in range(1,n+1):
            m=m*i
        str1=str(m)
        str1=str1[::-1]
        for w in str1:
            if int(w)!=0:
                break
            if int(w)==0:
                num=num+1
        return num
'''
这个会出现超时问题
'''
class Solution:
    """
    @param: n: An integer
    @return: An integer, denote the number of trailing zeros in n!
    """
    def trailingZeros(self, n):
        # write your code here, try to do it without arithmetic operators.  
        count = 0  
        while n>0:  
            count=int(count+ n / 5 ) 
            int(count)
            n = n/5 
            if n<1:
                n=int(n)
        count=int(count)
        return count
'''
不知道怎么改一下程序了
'''
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值