题解 | 牛牛学数列6
牛牛学数列6
https://www.nowcoder.com/practice/b6321648517247b2ac2e2f80cbc63ae1
#include <stdio.h>
int a(int m) {
if (m == 1) {
return 0;
} else if (m == 2 || m == 3) {
return 1;
} else {
return a(m - 3) + 2 * a(m - 2) + a(m - 1);
}
}
int main() {
int m, ret;
scanf("%d", &m);
ret = a(m);
printf("%d", ret);
}
递归法解决
查看20道真题和解析