给定一个十进制的整数，写下从1开始到N的所有整数，计算其中出现的所有"1"的个数

最新推荐文章于 2023-05-01 18:01:04 发布

GHX05130319

最新推荐文章于 2023-05-01 18:01:04 发布

阅读量1.7k

点赞数

文章标签： namespace iostream

本文链接：https://blog.csdn.net/ghx05130319/article/details/45043521

版权

#include<iostream>
using namespace std;

int Sum1s(int n)
{
	int count = 0; //记录1的个数
	int factor = 1; //标记，逐位计算1的个数

	int LowerNum = 0;
	int CurrNum = 0;
	int HigherNum = 0;

	while ( n/factor != 0)        //每次计算LowerNum CurrNum HigherNum的值
	{
		LowerNum = n - (n/factor) * factor;
		CurrNum = (n/factor) % 10;
		HigherNum = n / (factor*10);

		switch (CurrNum)
		{
		case 0:
			count += HigherNum * factor;
			break;
		case 1:
			count += HigherNum * factor + LowerNum +1;
			break;
		default:
			count += (HigherNum +1)*factor;
			break;
		}
		factor *= 10;
	}
	return count;
}

void main()
{
	cout<<Sum1s(5143)<<endl;
}