倒序输出数字
示例:298—>892
思路:想到利用取余10得到最后一位,接着将原数变为原数整除10…… 为迭代过程,想到loop或者recursion.
代码示例:
法一:利用递归
public class ReverseNumber {
public static int reverseForm(int n) {
if(n<10) {
return n;
}
System.out.print(n%10);
return reverseForm(n/10);
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.print("Enter a positive integer: ");
int n = scan.nextInt();
System.out.println(reverseForm(n));
}
}
法二:for循环
public class ReverseNumber {
public class ReverseNumber {
public static void reverseForm(int n) {
for(int i=n;i>0;i/=10) {
System.out.print(i%10); //!!注意是print 不是println,否则不在同一行。下面同理
}
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.print("Enter a positive integer: ");
int n = scan.nextInt();
reverseForm(n);
}
}
}
法三:while循环
public class ReverseNumber {
public class ReverseNumber {
public static void reverseForm(int n) {
int i=n;
while(i>0) {
System.out.print(i%10);
i/=10;
}
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.print("Enter a positive integer: ");
int n = scan.nextInt();
reverseForm(n);
}
}
}