[Algorithm] 2. Trailing Zeros - 技术经验

w3xue

免费教程

技术经验

手册 / 书籍

工具箱

当前位置：技术经验 » 程序设计 » C » 查看文章

[Algorithm] 2. Trailing Zeros

来源：cnblogs　　作者：jjlovezz　　时间：2018/11/6 10:17:54　　对本文有异议

Description

Write an algorithm which computes the number of trailing zeros in n factorial.

Example

11! = 39916800, so the out should be 2

Challenge

O(log N) time

Answer

 1     /*
 2      * @param n: A long integer
 3      * @return: An integer, denote the number of trailing zeros in n!
 4      */
 5     long long trailingZeros(long long n) {
 6         // write your code here, try to do it without arithmetic operators.
 7         if(n<5){
 8             return 0;
 9         }
10         else{
11             return n/5 + trailingZeros(n/5);
12         }
13     }

Tips

This solution is implemented by a recursive method, we can also use a loop method to solve this problem.

 1     /*
 2      * @param n: A long integer
 3      * @return: An integer, denote the number of trailing zeros in n!
 4      */
 5     long long trailingZeros(long long n) {
 6         // write your code here, try to do it without arithmetic operators.
 7         long long result = 0;
 8         while ( n > 0)
 9         {
10             result += n/5;
11             n /= 5;
12         }
13         
14         return result;
15     }