233. 数字 1 的个数
分析:https://blog.csdn.net/qq_39611310/article/details/119772883
/**
* 233. 数字 1 的个数
*/
public class Solution233 {
public int countDigitOne(int n) {
int res = 0;
long mulk = 1;
while (n >= mulk) {
res += (n / (mulk * 10)) * mulk + Math.min(Math.max(n % (mulk * 10) - mulk + 1, 0L), mulk);
mulk *= 10;
}
return res;
}
}