题解 | #整数中1出现的次数#

class Solution {
public:
    int NumberOf1Between1AndN_Solution(int n) {
        int res = 0;
        int cur = 0;
        for(int i = 1; i <= n; ++i)
        {
            cur = i;
            while (cur>10) {// 处理 >10 情况
                if(cur%10 == 1){// 求余运算求1情况，由于十进制所以对10求余
                    res++;
                }
                cur /= 10;// 更新数值
            }
            if(cur%10 == 1 || cur % 10 == 0)// 处理一些特殊情况
            {
                res++;
            }
            //std::cout << " i res : " << i << " " << res << std::endl;
        }
        return res;
    }
};