斐波那契数的动态规划解法

/**
	 * 动态规划方法解决fibonacci
	 * @param n
	 * @return
	 */
	private static int fib(int n) {
		int last, nextToLast, answer = 0;
		if (n <= 1) {
			return 1;
		}
		last = nextToLast = 1;
		for (int i = 0; i < n; i++) {
			//f(n)=f(n-1)+f(n-2)
			answer = last + nextToLast;
			//f(n-2)=f(n-1)
			nextToLast = last;
			//f(n-1)=f(n)
			last = answer;
		}

		return answer;
	}