统计0-N之间1的个数

转载请注明出处：francsicolv http://www.cnblogs.com/franciscolv/archive/2011/11/20/2255843.html.

暴力递归要注意溢出问题。方法2通过判断规律进行次数非常有限的递归。

package SortSet;

/**
 * 求o-n之间1的个数
 * 
 * @author Administrator
 * 
*/
public class OneCount {

public static void main(String[] args) {
        System.out.println(getOneCount(113));
        System.out.println(getOneCount2(113));
    }

public static int getOneCount(int n) {
if (n == 1)
return 1;
else if (n < 10)
return 1;
else
return getOneCount(n - 1) + countOne(n);
    }

private static int countOne(int n) {
int count = 0;
if (n == 1)
return 1;
else if (n < 10)
return 0;
else {
while (n > 0) {
int result = n % 10;
if (result == 1)
                    count++;
                n /= 10;
            }
return count;
        }
    }

public static int getOneCount2(int n) {

if (n < 10)
return n >= 1 ? 1 : 0;
else {
int count = 0;
int tmp = n;
while (n > 10) {
                n /= 10;
                count++;
            }
int head = n;
int num = getHeadNum(count);
if (head == 1)
return getOneCount2(num - 1) + getOneCount2(tmp - num) + tmp
                        - num + 1;
else
return head * getOneCount2(num - 1)
                        + getOneCount2(tmp - head * num) + num;

        }
    }

private static int getHeadNum(int n) {
int result = 1;
for (int i = 0; i < n; i++)
            result *= 10;
return result;
    }
}

　　

转载于:https://www.cnblogs.com/franciscolv/archive/2011/11/20/2255843.html