Question

Please create a functioning Java program which includes the following:

Recursive string reverse tail reverse(s.substring (1, s.length())ג + s.substring(0,1) first character tail reversed by recursive call

Answer 1

//Main.java
public class Main {
  public static String reverse(String s){
    if(s==null || s.length() == 0){
      return "";
    }
    else{
      return reverse(s.substring(1,s.length()))+s.substring(0,1);
    }
  }

  public static void main(String[] args) {
    System.out.println(reverse("hello"));
  }
}

olleh