Java代码优化

递归与迭代

/** * 递归 * @param n * @return */public static long computeIteratively2(int n) {if (n > 1)return computeIteratively2(n - 1) + computeIteratively2(n - 2);return n;}/** * 迭代 * @param n * @return */public static long computeIteratively(int n) {if (n > 1) {long a = 0, b = 1;do {long tmp = b;b += a;a = tmp;} while (--n > 1);return b;}return n;}