Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
27 lines (25 loc) · 680 Bytes

File metadata and controls

27 lines (25 loc) · 680 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/*
Author: King, wangjingui@outlook.com
Date: Dec 13, 2014
Problem: Factorial Trailing Zeroes
Difficulty: Easy
Source: https://oj.leetcode.com/problems/factorial-trailing-zeroes/
Notes:
Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
Solution: ...
*/
public class Solution {
public int trailingZeroes_1(int n) {
int res = 0;
while (n != 0) {
res += n / 5;
n = n / 5;
}
return res;
}
public int trailingZeroes_2(int n) {
if (n == 0) return 0;
return n / 5 + trailingZeroes_2(n / 5);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.