java递归倒序字符串,什么是在Java中以递归方式反转字符串的最佳方法？

I have been messing around with recursion today. Often a programming technique that is not used enough.

I set out to recursively reverse a string. Here's what I came up with:

//A method to reverse a string using recursion

public String reverseString(String s){

char c = s.charAt(s.length()-1);

if(s.length() == 1) return Character.toString(c);

return c + reverseString(s.substring(0,s.length()-1));

}

My question: is there a better way in Java?

解决方案

The best way is not to use recursion. These stuff are usually used to teach students the recursion concept, not actual best practices. So the way you're doing it is just fine. Just don't use recursion in Java for these kind of stuff in real world apps ;)

PS. Aside what I just said, I'd choose "" as the base case of my recursive function:

public String reverseString(String s){

if (s.length() == 0)

return s;

return reverseString(s.substring(1)) + s.charAt(0);

}