答:方法很多,可以自己写实现也可以使用String或StringBuffer/StringBuilder中的方法。有一道很常见的面试题是用递归实现字符串反转,代码如下所示:
<code class="language-Java hljs cs has-numbering"> <span class="hljs-keyword">public</span> <span class="hljs-keyword">static</span> String <span class="hljs-title">reverse</span>(String originStr) { <span class="hljs-keyword">if</span>(originStr == <span class="hljs-keyword">null</span> || originStr.length() <= <span class="hljs-number">1</span>) <span class="hljs-keyword">return</span> originStr; <span class="hljs-keyword">return</span> reverse(originStr.substring(<span class="hljs-number">1</span>)) + originStr.charAt(<span class="hljs-number">0</span>); }</code>