fibonacci series
//basic fibonacci series
0, 1, 1, 2, 3, 5, 8, 13, 21, ...fibonacci series
//basic fibonacci series
0, 1, 1, 2, 3, 5, 8, 13, 21, ...fibonacci series
// Fibonacci Series
0,1,1,2,3,5,8,13,21,34,55,89,144......Fibonacci series
//to find nth fibonacci number(recursive solution)
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}fibinachi
def fib(n):
lisp = []
for i in range(n):
if len(lisp) < 3:
if len(lisp) == 0:
lisp.append(0)
else:
lisp.append(1)
else:
lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
return lispfibonacci series
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}fibonacci series
//basic fibonacci series
0, 1, 1, 2, 3, 5, 8, 13, 21, ...fibonacci series
// Fibonacci Series
0,1,1,2,3,5,8,13,21,34,55,89,144......Fibonacci series
//to find nth fibonacci number(recursive solution)
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}fibinachi
def fib(n):
lisp = []
for i in range(n):
if len(lisp) < 3:
if len(lisp) == 0:
lisp.append(0)
else:
lisp.append(1)
else:
lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
return lispfibonacci series
class Solution {
public int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 1;
}
return fib(n-1)+fib(n-2);
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
