剑指OFFER 整数中1出现的次数

class Solution {
public:
    int hwo_many(int n)
    {
        int count=0;
        while(n!=0)
        {
            if(n%10==1)count++;
            n/=10;
        }
        return count;
    }
    
    int NumberOf1Between1AndN_Solution(int n)
    {
        int count = 0;
        for(int i=1;i<=n;i++){
            count += hwo_many(i);
        }
        return count;
    }
};

剑指OFFER 整数中1出现的次数

原文：https://www.cnblogs.com/virgildevil/p/12227445.html