题目描述:
完成一个递归程序,倒置字符数组。并打印实现过程
递归逻辑为:
当字符长度等于1时,直接返回
否则,调换首尾两个字符,在递归地倒置字符数组的剩下部分
代码:
package lanqiao;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String n = sc.next();
int m = Integer.parseInt(n);
String str = sc.next();
char[] ch = new char[m];
ch = str.toCharArray();
if(m == 1){
System.out.println();
System.out.println(ch);
}
else{
for(int i = 0,j = m - 1;i < j;i ++,j --){
char c = ch[i];
ch[i] = ch[j];
ch[j] = c;
System.out.println(ch);
}
System.out.println();
// for(int i = 0;i < str.length();i ++)
// {
// System.out.print(ch[i]);
// }
System.out.println(ch);
}
}
}