统计数字

计算数字k在0到n中的出现的次数，k可能是0~9的一个值

例如n=12，k=1，在 [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]，我们发现1出现了5次 (1, 10, 11, 12)

class Solution {
public:
    /*
     * param k : As description.
     * param n : As description.
     * return: How many k's between 0 and n.
     */
    int digitCounts2(int k, int b)
    {
        if( b == 1 ) return 1;
        int total = pow(10, b) * b;
        if( k > 0 ) return total / 10;
        else
        {
            return total / 10 - ((int)pow(10, b) - 10) / 9;
        }
    }
    
    int digitCounts(int k, int n) {
        // write your code here
        if( n < 10 ) return k <= n ? 1 : 0;
        
        int m = log10(n+1), res = 0;
        if( n+1 == pow(10,m)) return digitCounts2(k,m);
        
        int *d = new int[m+1];
        
        for( int i = 0; i <= m; ++i )
        {
            int x = pow(10, m-i+1);
            d[i] = (n%x) / (x/10);
        }
        
        res += digitCounts2(k, m);
        //k locate in first pos
        if( k > 0 && k <= d[0] )
        {
            if( k == d[0] ) res += (n - d[0] * pow(10, m) + 1);
            else res += pow(10,m);
        }
        
        //k locate in other pos, except the first bit is d[0]
        res += (d[0]-1) * pow(10,m-1) * m; 
        
        //the first bit is d[0]
        int nn = n;
        for( int i = 1; i <= m; ++i )
        {
            nn -= d[i-1] * pow(10, m-i+1);
            if( k <= d[i] )
            {
                if( k == d[i] ) res += (nn - d[i]*pow(10, m-i) + 1);
                else res += pow(10, m-i);
            }
            res += d[i] * pow(10,m-i-1) * (m-i);
        }
    
        return res;
    }
};