import java.util.Stack;
public class StringReverse {
int length = s.length();
if (length <= 1)
return s;
String left
= s.
substring(0, length
/ 2);
String right
= s.
substring(length
/ 2, length
);
return reverse1(right) + reverse1(left);
}
int length = s.length();
for (int i = 0; i < length; i++)
reverse = s.charAt(i) + reverse;
return reverse;
}
char[] array = s.toCharArray();
for (int i = array.length - 1; i >= 0; i--)
reverse += array[i];
return reverse;
}
}
char[] s = orig.toCharArray();
int n = s.length - 1;
int halfLength = n / 2;
for (int i = 0; i <= halfLength; i++) {
char temp = s[i];
s[i] = s[n - i];
s[n - i] = temp;
}
}
char[] str = s.toCharArray();
int begin = 0;
int end = s.length() - 1;
while (begin < end) {
str[begin] = (char) (str[begin] ^ str[end]);
str[end] = (char) (str[begin] ^ str[end]);
str[begin] = (char) (str[end] ^ str[begin]);
begin++;
end--;
}
}
char[] str = s.toCharArray();
Stack<Character> stack = new Stack<Character>();
for (int i = 0; i < str.length; i++)
stack.push(str[i]);
for (int i = 0; i < str.length; i++)
reversed += stack.pop();
return reversed;
}
}
//java/1312