Factorial Trailing Zeroes-白红宇

Factorial Trailing Zeroes

发布时间：2019-05-25

本文共 550 字，大约阅读时间需要 1 分钟。

public class Solution {    public int trailingZeroes(int n) {        int count_5 = 0;		int tmp = 0;		for (int i = 5; i <= n; i++) {			if (i % 5 == 0) {				count_5++;				tmp = i / 5;				while (tmp >= 5 && tmp % 5 == 0) {					count_5++;					tmp = tmp / 5;				}			}else{				continue;			}		}		return count_5;    }}

转载地址：http://knuni.baihongyu.com/

Factorial Trailing Zeroes Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. Credits: Special thanks to for adding this problem and creating all test cases. Java代码：

public class Solution { public int trailingZeroes(int n) { int count_5 = 0; int tmp = 0; for (int i = 5; i <= n; i++) { if (i % 5 == 0) { count_5++; tmp = i / 5; while (tmp >= 5 && tmp % 5 == 0) { count_5++; tmp = tmp / 5; } }else{ continue; } } return count_5; }}

Factorial Trailing Zeroes

Given an integer n, return the number of trailing zeroes in n!.

Note: Your solution should be in logarithmic time complexity.

Credits:
Special thanks to for adding this problem and creating all test cases.
Java代码：