顿搜
飞过闲红千叶，夕岸在哪
类目归类
[LeetCode 172] Factorial Trailing Zeroes [Java] [Runtime : 1MS]
09/02
1. Description
Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
2. Runtime Distribution
3. Submission Details
4. Example
Input 25
Output 6
5. Code
public int trailingZeroes(int n) {
if (n < 0) {
return -1;
}
int count = 0;
while (n != 0) {
n /= 5;
count += n;
}
return count;
}6.Test
public class LeetCode0172 {
public int trailingZeroes(int n) {
if (n < 0) {
return -1;
}
int count = 0;
while (n != 0) {
n /= 5;
count += n;
}
return count;
}
public static void main(String[] args) {
LeetCode0172 leetcode = new LeetCode0172();
System.out.println(leetcode.trailingZeroes(25));
}
}
