digitCounts 统计0-n之间k字符出现的个数

public int digitCounts(int k, int n) {
		int count = 0;
		char kChar = (char)(k + '0');
		for (int i = k; i <= n; i++) {
			char[] iChars = Integer.toString(i).toCharArray();
			for (char iChar : iChars) {
				if (kChar == iChar) count++;
			}
		} 
		return count;
		}