zoukankan      html  css  js  c++  java
  • 剑指offer12 打印从1到N位的所有数字,处理大整数情况

    /**
     * 
     */
    package jianzhioffer;
    
    /**
     * @Description  输入n位数,输出0-N的所有数
     * @author liutao
     * @data 2016年4月22日
     */
    public class a12_print1ToMaxOfNDigits {
        public static void Print1ToN(int n){
            if(n<=0) return ;
            char[] number = new char[n];
            for(int i=0;i<10;i++){
                number[0] = (char)(i+'0');
                print1ToNRecursively(number,n,0);
            }
        }
        
        public static void print1ToNRecursively(char[] number,int length,int index){
            if(index == length-1){
                printNumber(number);
                return;
            }
            for(int i=0;i<10;++i){
                number[index+1] = (char)(i+'0');
                print1ToNRecursively(number,length,index+1);
            }
        }
        public static void printNumber(char[]num){
            boolean isBeginning = true;
            int len = num.length;
            for(int i=0;i<len;i++){
                if(isBeginning&&num[i]!='0'){
                    isBeginning = false;
                }
                if(!isBeginning){
                    System.out.print(num[i]);
                }
            }
            if(!isBeginning)
                System.out.println();
        }
        public static void main(String[] args) {
            Print1ToN(3);
        }
    }
  • 相关阅读:
    hdu 1542 Atlantis
    cf C. Cupboard and Balloons
    cf C. Tourist Problem
    hdu 4027 Can you answer these queries?
    hdu 1255 覆盖的面积
    hdu 1698 Just a Hook
    zoj 1610 Count the Colors
    hdu 4302 Holedox Eating
    hdu 4288 Coder
    tsne理论学习
  • 原文地址:https://www.cnblogs.com/todayjust/p/5421625.html
Copyright © 2011-2022 走看看