[codewars][python][C++]Count the Digit

Take an integer n (n >= 0) and a digit d (0 <= d <= 9) as an integer. Square all numbers k (0 <= k <= n) between 0 and n. Count the numbers of digits d used in the writing of all the k**2. Call nb_dig (or nbDig or ...) the function taking n and d as parameters and returning this count.

#Examples:

n = 10, d = 1, the k*k are 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100
We are using the digit 1 in 1, 16, 81, 100. The total count is then 4.

nb_dig(25, 1):
the numbers of interest are
1, 4, 9, 10, 11, 12, 13, 14, 19, 21 which squared are 1, 16, 81, 100, 121, 144, 169, 196, 361, 441
so there are 11 digits `1` for the squares of numbers between 0 and 25.

Note that 121 has twice the digit 1.

思路：遍历0-n的平方，数字转字符串找指定的数字的个数

代码如下：

【python】

def nb_dig(n, d):
    count=0
    s=str(d)
    for i in range(n+1):
        num=i*i
        count+=str(num).count(s)
    return count

 

【C++】

#include <algorithm>
#include <string>
using namespace std;

int nbDig(int n, int d)
{
    int digit = 0;
    char c = (char)d + '0'; 
    for (int i = 0; i <= n; i++)
    {
        int num = i * i;
        string str = to_string(num);
        digit += count(str.begin(), str.end(), c);
    }
    return digit;
}