[LeetCode] Factorial Trailing Zeroes
2014-12-31 15:25
351 查看
Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
Note: Your solution should be in logarithmic time complexity.
class Solution { public: int trailingZeroes(int n) { int ans = 0; while(n){ ans += n / 5; n /= 5; } return ans; } };
相关文章推荐
- LeetCode Factorial Trailing Zeroes (阶乘后缀零)
- LeetCode - Factorial Trailing Zeroes
- LeetCode Factorial Trailing Zeroes
- leetcode 172-Factorial Trailing Zeroes
- 【leetcode】【172】Factorial Trailing Zeroes
- Leetcode_Factorial Trailing Zeroes(耗时问题)
- LeetCode:Factorial Trailing Zeroes
- [LeetCode][172][Factorial Trailing Zeroes]
- LeetCode Factorial Trailing Zeroes
- [Leetcode]Factorial Trailing Zeroes
- [leetcode]C语言:172 Factorial Trailing Zeroes
- leetcode--Factorial Trailing Zeroes
- LeetCode 172:Factorial Trailing Zeroes
- LeetCode 172 Factorial Trailing Zeroes
- Leetcode 172 Factorial Trailing Zeroes
- leetcode 172: Factorial Trailing Zeroes
- LeetCode题解:Factorial Trailing Zeroes
- leetcode-172 Factorial Trailing Zeroes
- LeetCode 之 Factorial Trailing Zeroes
- LeetCode || Factorial Trailing Zeroes