1、求一个数的阶乘： /* 递归算法* param number 某个数* return 某个数的阶乘*/public static long recursion(int number)/非法时if(number numbersj) temp = numbersi;numbersi = numbersj; numbersj = temp;for (int i = 0; i base) & (j start) j-;if (i i) quickSort(numbers, i, end); for (int i = 0; i i; j-) if (numbersj 0 j-) numbersj = numbersj - 1;numbersj = temp;for (int i = 0; i = 0; i-)sb.append(str.charAt(i);return sb.toString(); /* 递归* param str 需要转换的字符串* return 翻转好的字符串*/public static String method(String str)if(str.length() 1)return method(str.substring(1) + str.substring(0, 1);elsereturn str;