剑指 Offer 43. 1～n整数中1出现的次数java题解

时间复杂度O(log(n)) 空间复杂度O(1)

每轮的结果算法，由找规律得到

class Solution {
    public int countDigitOne(int n) {
        int res=0;
        int high=n/10,cur=n%10,low=0,digit=1;
        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加入low，组成下轮low
            cur=high%10;//下轮cur是本轮high的最低位
            high=high/10;//得到下轮high
            digit=digit*10;//位因子每轮*10
        }
        return res;
    }
}