10月23腾讯笔试递归题

题如下：

计算f(m, n)

f(m, n) = m + n + 1, 如果m*n = 0

否则f(m, n) = f(m - 1, f(m, n - 1))

程序如下，在(1)~(4)处补充语句：

#include <stdio.h> #define MAX 100 int main() { int STACK[MAX]; int top; int f; int m, n; scanf("%d%d", &m, &n); top = 0; do { if (m*n > 0){ //(1) //(2) }else{ f = m + n + 1; if (top > 0){ //(3) } //(4) n = f; } }while (!(-1 == top)); printf("f = %d/n", f); return 0; } 

 

---

 

当时想破脑袋了，就是没想好怎么办，知道栈是用来模拟递归的，也知道栈中存放的肯定是m值，但就没想好怎么去保存和恢复，回来编个程序，弄弄倒是出来了，如下

 

/* * f(m, n) = m + n + 1 if m*n = 0 * f(m, n) = f(m - 1, f(m, n - 1)) */ #include <stdio.h> #include <assert.h> #include <stdlib.h> #include <setjmp.h> #define MAX (1 << 15) static jmp_buf jbuf; #define DEBUG static int getf(int m, int n) { if (n > 1024){ printf("m or n is too large, getf return directly/n"); longjmp(jbuf, 1); } if (!(m * n)) return m + n + 1; return getf(m - 1, getf(m, n - 1)); } int main() { int STACK[MAX]; int top; int f; int m, n; printf("input m and n: "); scanf("%d%d", &m, &n); if (setjmp(jbuf) == 0){ printf("f = %d/n", getf(m, n)); } top = 0; do { if (m*n > 0){ assert(top < MAX); /*only for correctness check*/ STACK[top++] = m - 1; n--; }else{ f = m + n + 1; if (top > 0){ m = STACK[top - 1]; } top--; n = f; } #ifdef DEBUG { int i; printf("(m, n) = (%d, %d), top = %d :", m, n, top); for (i = top - 1; i >= 0; i--){ printf("%3d", STACK[i]); } printf("/n"); } #endif }while (!(-1 == top)); printf("f = %d/n", f); return 0; }

题目也有误导性，那些缩进啊，我还以为是要填if语句什么的，原来就是迷惑人的。

考虑f(2, 2)，每次循环后m, n, top及栈中的值变化如下：

 

 

(m, n) = (2, 1), top = 1 :  1

(m, n) = (2, 0), top = 2 :  1  1

(m, n) = (1, 3), top = 1 :  1

(m, n) = (1, 2), top = 2 :  0  1

(m, n) = (1, 1), top = 3 :  0  0  1

(m, n) = (1, 0), top = 4 :  0  0  0  1

(m, n) = (0, 2), top = 3 :  0  0  1

(m, n) = (0, 3), top = 2 :  0  1

(m, n) = (0, 4), top = 1 :  1

(m, n) = (1, 5), top = 0 :

(m, n) = (1, 4), top = 1 :  0

(m, n) = (1, 3), top = 2 :  0  0

(m, n) = (1, 2), top = 3 :  0  0  0

(m, n) = (1, 1), top = 4 :  0  0  0  0

(m, n) = (1, 0), top = 5 :  0  0  0  0  0

(m, n) = (0, 2), top = 4 :  0  0  0  0

(m, n) = (0, 3), top = 3 :  0  0  0

(m, n) = (0, 4), top = 2 :  0  0

(m, n) = (0, 5), top = 1 :  0

(m, n) = (0, 6), top = 0 :

(m, n) = (0, 7), top = -1 :

太晚了，读者自己去分析这些输出数据吧。