首页 > 代码库 > LeetCode Factorial Trailing Zeroes
LeetCode 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.
1 public class Solution { 2 public int trailingZeroes(int n) { 3 if (n <= 1) { 4 return 0; 5 } 6 long c2=0; 7 long c5=0; 8 for (int i = n; i > 1; i--) { 9 int k=i;10 while (k % 5 == 0) {11 c5++;12 k = k / 5;13 }14 while (k % 2 == 0) {15 c2++;16 k = k / 2;17 }18 }19 return (int) Math.min(c2, c5);20 }21 }
LeetCode Factorial Trailing Zeroes
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。