递归]leetcode509:裴波那契数(easy)"/>
[递归]leetcode509:裴波那契数(easy)
题目:
题解:
class Solution {
public://解法1:递归法int fib_1(int N) {if(N<2)return N;else return fib(N-1)+fib(N-2);}//解法2:迭代法int fib_2(int N){if(N<2)return N;int a=0,b=1,c=1;for(int i=2;i<=N;++i){c=a+b;a=b;b=c;}return c;}
};
更多推荐
[递归]leetcode509:裴波那契数(easy)
发布评论