class Solution {
public:
int trailingZeroes(int n) {
int ans1=0;
while(n > 0){
ans1 += n/5;
n/=5;
}
return ans1;
}
};
leetcode 172. Factorial Trailing Zeroes
最新推荐文章于 2024-09-18 11:04:20 发布