LintCode-剑指Offer-(3)统计数字

class Solution {public:    /*     * param k : As description.     * param n : As description.     * return: How many k's between 0 and n.     */   int countint(int k,int n){        int num = 0;        if(k==0&&n==0)return 1;        while (n!=0){            num += (n==k) ? 1 : 0;            n /= 10;        }        return num;    }    int digitCounts(int k,int n) {        // write your code here        int num = 0;        for (int i = 0;i<=n;i++){            num += countint(k,i);        }        return num;    }};