172. Factorial Trailing Zeroes

Posted 米开朗菠萝

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了172. Factorial Trailing Zeroes相关的知识,希望对你有一定的参考价值。

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

Note: Your solution should be in logarithmic time complexity.

 

 1 int trailingZeroes(int n) {
 2     if(n < 5)
 3         return 0;
 4     int k = 0;
 5     while(n)
 6     {
 7         n = n / 5;
 8         k += n;
 9     }
10     return k;
11 }

转:http://www.jianshu.com/p/211618afc695

以上是关于172. Factorial Trailing Zeroes的主要内容,如果未能解决你的问题,请参考以下文章

172. Factorial Trailing Zeroes

172. Factorial Trailing Zeroes

172. Factorial Trailing Zeroes

172. Factorial Trailing Zeroes

172. Factorial Trailing Zeroes

Leetcode 172 Factorial Trailing Zeroes