递归算法
//如何实现字符串的反转及替换
public static String reverse(String originStr) {
if (originStr == null || originStr.length() <= 1)
return originStr;
return reverse(originStr.substring(1)) + originStr.charAt(0);
}
//如何实现字符串的反转及替换
public static String reverse(String originStr) {
if (originStr == null || originStr.length() <= 1)
return originStr;
return reverse(originStr.substring(1)) + originStr.charAt(0);
}