编程之美-2.4 1的个数

#include "stdafx.h"
typedef int ULONGLONG;


/**
method1 不可取 O(N*lgN)
*/
ULONGLONG Count1InAInteger(ULONGLONG n)
{
ULONGLONG iNum=0;
while(n!=0)
{
iNum+=(n%10==1)?1:0;
n/=10;
}
return iNum;
}


ULONGLONG f (ULONGLONG n)
{
ULONGLONG iCount=0;
for(int i=1;i<=n;i++)
{
iCount+=Count1InAInteger(i);
}
return iCount;
}


/**
method2
*/


int Sum1s(int n)
{
    int iCount=0;
int iFactor=1;
int iLower=0;
int iCurr=0;
int iHigher=0;
while((n/iFactor)!=0)
{
iLower=n-(n/iFactor)*iFactor;
iCurr=(n/iFactor)%10;
iHigher=n/(iFactor*10);


switch(iCurr)
{
case 0:
iCount+=iHigher*iFactor;
break;
case 1:
iCount+=iHigher*iFactor+iLower+1;
break;
default:
iCount+=(iHigher+1)*iFactor;
break;


}
iFactor*=10;


}
return iCount;


}




int _tmain(int argc, _TCHAR* argv[])
{
int n;
scanf("%d",&n);
printf("%d",Sum1s(n));
return 0;
}