class Solution {
public:
int NumberOf1Between1AndN_Solution(int n)
{
if(n < 1) return 0;
if(n == 1) return 1;
int sum = 0;
for(int i = 1; i <= n; i++)
{
int t = i;
while(t)
{
if(t % 10 == 1) sum++;
t /= 10;
}
}
return sum;
}
};
剑指offer:整数中1出现的次数(从1到n整数中1出现的次数)
最新推荐文章于 2020-06-15 17:53:54 发布