题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution { //简单一次递归 public: int Fibonacci(int n) { if(n==1||n==2) return 1; else return Fibonacci(n-2)+Fibonacci(n-1);
}
};
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution { //简单一次递归 public: int Fibonacci(int n) { if(n==1||n==2) return 1; else return Fibonacci(n-2)+Fibonacci(n-1);
}
};
相关推荐