题解 | 二维斐波那契数列
二维斐波那契数列
https://www.nowcoder.com/practice/a1951ca9431646ff8f9bc6f6d24d1e0a
#include <stdio.h>
#include <stdlib.h>
int main() {
int n,m;
scanf("%d %d",&n,&m);
int **fib = (int **)malloc(sizeof(int *)*n);
int i,j;//遍历数组指针
for(int i = 0;i < n;i++){
fib[i] = (int *)malloc(sizeof(int)*m);
}//动态申请二维数组
for(i=0;i<n;i++){
for(j=0;j<m;j++){
fib[i][j] = 0;
}
}//为数组赋值
for(j = 0;j<m;j++){
fib[0][j] = 1;
}
for(i = 0;i < n;i ++){
fib[i][0] = 1;
}
for(i = 1;i<n;i++){
for(j=1;j<m;j++){
fib[i][j] = (fib[i-1][j] + fib[i][j-1]) % 1000000007;
}
}
printf("%d",fib[n-1][m-1]);
return 0;
}
寻找递推规律
查看8道真题和解析
