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

class Solution {

public:

    int NumberOf1Between1AndN_Solution(int n) {

        int sum=0;

        if(n==0){

            return 0;

        }

        for(int i=1;i<=n;i+=1){

            sum+=judge(i);

        }

        return sum;

    }

    int judge(int shu){

        int count=0;

        while(shu!=0){

            if(shu%10==1){

                count+=1;

            }

            shu/=10;

        }

        return count;

    }

};