用递归实现字符串倒置

	public static String reverse(String str) {
        if ((null == str) || (str.length()  <= 1)) {
            return str;
        }
        return reverse(str.substring(1)) + str.charAt(0);
    }

比如输入一个字符串"abcde"

//1  reverse(bcde) + a

        //2  reverse(cde) + b + a

//3  reverse(de) + c + b + a

//4 reverse(e) + d + c + b + a

//5 e + d + c + b + a ,即 "edcba"，最后返回该倒置字符串