leetcode 172 Factorial Trailing Zeroes C++
2016-05-30 16:57
423 查看
这道题就是看n里面有多少个5+5^2+5^3......
int trailingZeroes(int n) {
if(n==0) return 0;
int num = 0;
if(n/5<5) return n/5;
int tmp;
while((tmp = n/5) != 0){
num += tmp;
n=tmp;
}
return num;
}
int trailingZeroes(int n) {
if(n==0) return 0;
int num = 0;
if(n/5<5) return n/5;
int tmp;
while((tmp = n/5) != 0){
num += tmp;
n=tmp;
}
return num;
}
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解