Description
Count the number of k’s between 0 and n. k can be 0 - 9.
public class Solution {
// 遍历0~n 对于每一个数查找对应数值k的数目 再求和
public int digitCounts(int k, int n) {
// write your code here
int result = 0;
for (int i = 0; i <= n; i++) {
result += inOneNumber(i, k);
}
return result;
}
private int inOneNumber(int number, int target) {
if (number < 10) {
return target == number ? 1 : 0;
}
int k = number;
int result = 0;
while(k > 0) {
int tmp = k % 10;
if (tmp == target) {
result++;
}
k /= 10;
}
return result;
}
}