首页 > 代码库 > 172. Factorial Trailing Zeroes
172. 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 @ts for adding this problem and creating all test cases.
public class Solution { public int trailingZeroes(int n) { // math : n * n-1 * n-2...1 = 2 ^ x * 5 ^ y depend on y int cnt = 0; while(n > 0){ cnt += n/5; n = n/5; //26 or 126 } return cnt; } }
172. Factorial Trailing Zeroes
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。