172. 阶乘后的零

为保证权益，题目请参考 172. 阶乘后的零(From LeetCode).

解决方案1

CPP

#include <iostream>

using namespace std;

class Solution {
public:
    int trailingZeroes(int n) {
        int ans = 0;
        for (int i = 5; i <= n; i++) {
            int j = i;
            while (j % 5 == 0) {
                ans += 1;
                j = j / 5;
            }
        }
        return ans;
    }
};

void runTest(){
    Solution so;
    cout << so.trailingZeroes(30) << endl;
}

int main() {
    runTest();
    return 0;
}

Python

# 172. 阶乘后的零
# https://leetcode.cn/problems/factorial-trailing-zeroes/


class Solution:
    def trailingZeroes(self, n: int) -> int:
        ans = 0
        while n != 0:
            ans += (n := n // 5)
        return ans