剑指offer 整数中1出现的次数（从1到n整数中1出现的次数）

 1 class Solution {
 2 public:
 3     int NumberOf1Between1AndN_Solution(int n)
 4     {
 5         int count = 0;
 6         for(int i = 1; i <= n; i ++){
 7             int num = i;
 8             while(num){
 9                 if(num % 10 == 1)
10                     count ++;
11                 num = num / 10;
12             }
13         }
14         return count;
15     }
16 };