Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public int fibonacciRemember(int n) {
- if (n <= 0) return 0;
- if (n == 1) return 1;
- int first = 0, second = 1;//因為確定前兩個數了所以可以直接寫死
- for (int i = 2; i <= n; ++i) {
- int add = first + second;//在這邊每次都新開闢一個位置來儲存上一次的結果,f(n-1):first,f(n):second
- first = second;// f(n-1)放到f(n)
- second = add;// 把f(n)+f(n-1) 放到f(n)
- }
- return second;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement