/**
* 字符串反转(栈)
*
* @param str
* @return
*/
public String reverseStr(String str) {
char[] stack = new char[str.length()];// 栈
// 进栈
for (int i = 0; i < str.length(); i++) {
stack[i] = str.charAt(i);
}
// 出栈
StringBuffer reverseStr = new StringBuffer("");
for (int j = stack.length - 1; j >= 0; j--) {
reverseStr.append(stack[j]);
}
return reverseStr.toString();
}
/**
* 字符串反转(递归)
*
* @param str
* @return
*/
public static String recursionReverseStr(String str) {
int i = str.length();
if (i < 1) {
return "";
} else {
return str.charAt(--i) + recursionReverseStr(str.substring(0, i));
}
}
字符串反转
最新推荐文章于 2024-07-21 11:24:19 发布