思路:典型的递推求解,斐波那契,f(n)=f(n-1)+f(n-2);找规律即可
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner a=new Scanner(System.in);
while(a.hasNext())
{
int n=a.nextInt();
if(n>0&&n<=50)
{
long[] arr=new long[51];
arr[1]=1;arr[2]=2;arr[3]=3;
for(int i=4;i<51;i++)
arr[i]=arr[i-1]+arr[i-2];
System.out.println(arr[n]);
}
}
}
}
若有错误,还请指正;