//解法一 long long Fibonacci_Solution1(unsigned int n) { int result[2] = {0, 1, 2}; if (n <= 2) return result[n]; return Fibonacci_Solution1(n - 1) + Fibonacci_Solution1(n - 2); }
long long Fibonacci_Solution1(unsigned int n) { if (n <= 0) return 0; if (n == 1) return 1; return Fibonacci_Solution1(n - 1) + Fibonacci_Solution1(n - 2); }
//=============================================== Test Code =========================================================== void Test(int n, int expected) { if (Fibonacci_Solution1(n) == expected) printf("Test of %d in solution1 passed!\n", n); else printf("Test of %d in solution1 fialed!\n", n); if (Fibonacci_Solution2(n) == expected) printf("Test of %d in solution2 passed!\n", n); else printf("Test of %d in solution2 fialed!\n", n); }