[leetcode 数位计算]2520. 统计能整除数字的位数

class Solution {
    public int countDigits(int num) {
        String s = Integer.toString(num);
        int[] a = new int[10];
        for(char ch : s.toCharArray()) {
            a[ch-'0']++;
        }
        int ans = 0;
        for(int i=1; i<=9; i++) {
            if(a[i] == 0) continue;
            if(num % i == 0) ans += a[i];
        }
        return ans;
    }
}

class Solution:
    def countDigits(self, num: int) -> int:
        s = str(num)
        a = [0] * 10
        for ch in s:
            a[int(ch)] += 1
        ans = 0
        for i in range(1, 10):
            if a[i] == 0:
                continue
            if num % i == 0:
                ans += a[i]
        return ans