算法day11-----递归反转
public class A5 {
public static void main(String args[]) {
System.out.println(f("asdf",3));
}
public static String f(String s,int i) {
if(i==0) return ""+s.charAt(0);
return s.charAt(i)+f(s,i-1);
}
}
public class A5 {
public static void main(String args[]) {
System.out.println(f("asdf",3));
}
public static String f(String s,int i) {
if(i==0) return ""+s.charAt(0);
return s.charAt(i)+f(s,i-1);
}
}