递归法输出倒序数

1. import java.util.Scanner;
   
   
   public class zuoye {
   private static void daoxu(int a){
   System.out.print(a%10);
   if(a>10){
   daoxu(a/10);
   }
   }
   public static void main(String[] args) {
   // TODO Auto-generated method stub
   System.out.println(12|9);
   Scanner scan = new Scanner(System.in);
   System.out.println("请输入一个数字：");
   int a=Integer.valueOf(scan.nextInt());
   daoxu(a);
   }
   }

转载于:https://www.cnblogs.com/gzhnan/articles/9668242.html