数学分析。
class Solution {
public:
int trailingZeroes(int n) {
int cnt = 0;
while (n >= 5)
{
cnt += n / 5;
n /= 5;
}
return cnt;
}
};
相关文章
- 11-02leetcode 172. Factorial Trailing Zeroes求后面0的个数
- 11-02LeetCode_172. 阶乘后的零
- 11-02172. 阶乘后的零
- 11-02LeetCode 172. 阶乘后的零 Factorial Trailing Zeroes
- 11-02【leetcode】172. 阶乘后的零( Factorial Trailing Zeroes )
- 11-02Java 计算N阶乘末尾0的个数-LeetCode 172 Factorial Trailing Zeroes
- 11-02[LeetCode] Factorial Trailing Zeroes 求阶乘末尾零的个数
- 11-02[CareerCup] 17.3 Factorial Trailing Zeros 求阶乘末尾零的个数
- 11-02✡ leetcode 172. Factorial Trailing Zeroes 阶乘中的结尾0个数--------- java