剑指offer二十二：从1到n整数1出现的次数

#include<iostream>
using namespace std;

int numberOfOne(unsigned int n)
{
	int number = 0;
	while (n)
	{
		if (n % 10 == 1)
			number++;
		n = n / 10;
	}
	return number;
}

int numberOfOneBetwwen(unsigned int n)
{
	int number = 0;
	for (unsigned int i = 1; i <= n; i++)
	{
		number += numberOfOne(i);
	}
	return number;
}

int main()
{
	int a = 11;
	int result = numberOfOneBetwwen(a);
	cout << result << endl;
}