解题思路:斐波那契数列
注意事项:
参考代码:
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int [] arrays = new int[40];
arrays[0] = 0;
arrays[1] = 1;
arrays[2] = 2;
for(int i=3;i<arrays.length;i++) {
arrays[i] = arrays[i-1] + arrays[i-2];
}
while(N!=0) {
int M = in.nextInt();
System.out.println(arrays[M-1]);
N--;
}
}
0.0分
0 人评分