剑指offer 031、整数中1出现的次数(从1到n整数中1出现的次数)
题目
题解
太难了[/(ㄒoㄒ)/~~],真伤脑
copy @superkakayong 大佬的解法:
class Solution {
public:
int NumberOf1Between1AndN_Solution(int n) {
long digit = 1; // 若n是INT_MAX digit会在最后一次循环越界
int high = n / 10, cur = n % 10, low = 0;
int res = 0;
while (high != 0 || cur != 0) {
if (cur == 0) {
res += high * digit;
}
else if (cur == 1) {
res += high * digit + low + 1;
}
else {
res += (high + 1) * digit;
}
low += cur * digit;
cur = high % 10;
high /= 10;
digit *= 10;
}
return res;
}
};