(Easy) Factorial Trailing Zeros Leet Code

Description:

Given an integer n, return the number of trailing zeroes in n!.

Example 1:

Input: 3
Output: 0
Explanation: 3! = 6, no trailing zero.

Example 2:

Input: 5
Output: 1
Explanation: 5! = 120, one trailing zero.

Note: Your solution should be in logarithmic time complexity.

Accepted
166,842
Submissions
444,468

Solution . Partially Correct. Not capable of dealing with overflow.

 

class Solution {
    public int trailingZeroes(int n) {
        
         
        String tmp =  String.valueOf(FACTORIAL(n));
       System.out.print(tmp);
        int count = 0;
        
        for(int i = tmp.length()-1; i >0 ; i--){
            
            if(tmp.charAt(i)=='0'){
                
                count++;
            }
            else{
                break;
            }
        }
        
        return count;
            
           
    }
    
    
    public long FACTORIAL(int n){
        
        long res = n; 
        
        do{
            n = n-1;
            res = res* n;
        }
        
        while (n>1);
        
        return res;
    }
}

 

 

Solution: Math;

class Solution {
    public int trailingZeroes(int n) {
        
       if(n ==0){
           return 0;
       }

        return n/5+ trailingZeroes(n/5);
    }
}

 

https://www.geeksforgeeks.org/count-trailing-zeroes-factorial-number/

 

First, let's think about in what situation will we get a trailing zero. We get a trailing zero whenever we multiply a non zero number by 10.

 

Example: 1 * 10 = 10

 

Since 10 is made up of multiplying 2 by 5, another way to get a trailing zero is to multiply a non zero number by 2 and 5.

 

Example: 1 * 2 * 5 = 10

 

So, to count the number of trailing zeroes we just need to figure out how many times we multiply 2 by 5.

 

Example:
1 * (2 * 5) = 10 // one trailing zero
1 * (2 * 5) * (2 * 5) = 100 // two trailing zeroes

 

Now let's look at factorial.

 

The factorial of 5 is:
1 * 2 * 3 * 4 * 5 = 120
Since we have multiplied 2 and 5 once, there is one trailing zero.

 

The factorial of 10 is:
1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10 = 3628800
Another way to write this is:
1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 2 * 5 = 3628800
As you can see, we have multiplied 2 and 5 twice, so there are two trailing zeroes.

 

Instead of keeping track of the number of 2s and 5s, we really just need to keep track of the number of 5s. This is because in any factorial calculation there are always going to be more multiples of 2 than 5.

 

Example: From the numbers 1 to 10, there are five multiples of 2 but only two multiples of 5.

 

Question: How many 5s are there in the factorial of 25?
You may guess the answer is 25 / 5 = 5, however there are actually 6.

 

Here are all the multiples of 5 in the factorial of 25:
5, 10, 15, 20, 25
Another way to write this is:
(5 * 1), (5 * 2), (5 * 3), (5 * 4), (5 * 5)
As you can see, 5 is actually multiplied 6 times.

 

We can simplify the answer to the Factorial Trailing Zeroes question to the following:
(n / 5) + (n / 5^2) + (n / 5^3)... (n / 5^x)
We continue until 5^x is greater than n.

 

var trailingZeroes = function(n) {
    let numZeroes = 0;
    for (let i = 5; i <= n; i *= 5) { numZeroes += Math.floor(n / i); } return numZeroes; }; 

转载于:https://www.cnblogs.com/codingyangmao/p/11389927.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值