开始刷题leetcode day3：Factorial Trailing Zeroes
来源：互联网 发布：mdf文件恢复数据库 编辑：程序博客网 时间：2024/06/12 23:06
Given an integer n, return the number of trailing zeroes inn!.
Note: Your solution should be in logarithmic time complexity.
Java:
public class Solution {
public int trailingZeroes(int n) {
int k = 0;
if(n<0)return 0;
for(long i = 5; i<=n; i*=5)
{
k+= n/i;
}
return k;
}
}
注意需要用long i
具体方法参考了网上，只需要数5,25,125.。。。。（2的次数会比5的多，所以只需要数5）
0 0
- 开始刷题leetcode day3：Factorial Trailing Zeroes
- [leetcode]Factorial Trailing Zeroes
- [LeetCode] Factorial Trailing Zeroes
- Leetcode Factorial Trailing Zeroes
- Leetcode: Factorial Trailing Zeroes
- 【Leetcode】Factorial Trailing Zeroes
- leetcode:Factorial Trailing Zeroes
- Leetcode: Factorial Trailing Zeroes
- Leetcode: Factorial Trailing Zeroes
- [leetcode] Factorial Trailing Zeroes
- [LeetCode]Factorial Trailing Zeroes
- [LeetCode] Factorial Trailing Zeroes
- *Leetcode-Factorial Trailing Zeroes
- LeetCode: Factorial Trailing Zeroes
- leetcode Factorial Trailing Zeroes
- leetcode Factorial Trailing Zeroes
- Leetcode: Factorial Trailing Zeroes
- [Leetcode]Factorial Trailing Zeroes
- 非常喜欢的漫画《I'S》
- InstallAnywhere的自定义PANEL
- std map set 区别
- HMM
- vim的调试插件——gdbmgr
- 开始刷题leetcode day3：Factorial Trailing Zeroes
- 扬声器切换
- 大数据流式处理一个不能忽视的问题
- 游戏引擎/GUI的设计与实现-主题
- 开始刷题leetcode day3： Longest Common Prefix
- 在线预览
- 使用L脚本语言开发一个XML访问库
- L脚本语言的Helloworld
- [LeetCode]House Robber
