Java Recursive practice-Moves the "X" in the string all to the end of this string __java

Given a string, compute recursively a new string where all the lowercase ' x ' chars have-been to the "end of" moved G. EndX ("xxre") → "Rexx" EndX ("Xxhixx") → "hixxxx" EndX ("Xhixhix") → "hihixxx" The title is Codingbat.

The answer you made.

public string EndX (String str) {
  
  int index=str.indexof ("x");
  int length=str.length ();
  String newx= "";
 
  if (index+1==length) {return str;}
  else if (index==0&& (length>1)) {newx=str.substring (index+1,length);}
  else if (index==-1) return str;
  else{
  newx=str.substring (0,index) +str.substring (Index+1,str.length ());}

  Return EndX (NEWX) + "x";
}