递归输出错误 [英] Recursion wrong output

问题描述

我得到了以下代码

int go(int x){
   if (x<1)
      return 1;
   else
      return x + go(x-2) + go(x-3);
}

通过调用go(3)的答案是7，但是每次执行此操作(必须手动执行)时，我都会得到8.这是我的逻辑:

The answer is 7 by calling go(3)but everytime I do it (I have to do it by hand) I get 8. This is my logic:

3 + go(1)+ go(0)/1 = 3 + go(1)+1(因为0小于1)

3 + go(1) + go(0)/1 = 3 + go(1) + 1(because 0 is less than 1)

然后

3 + go(-1)= 3 +1

3 + go(-1) = 3 + 1

因此

3 + 4 + 1 = 8

3 + 4 + 1 = 8.

我在做什么错了?

推荐答案

听起来像您误以为go(1) = 3 + go(1-2)，而实际公式为go(1) = 1 + go(1-2) + go(1-3).

It sounds like you made mistake as go(1) = 3 + go(1-2) where the actual formula is go(1) = 1 + go(1-2) + go(1-3).

  go(3)
= 3 + go(1) + go(0)
= 3 + go(1) + 1
= 3 + (1 + go(-1) + go(-2)) + 1
= 3 + (1 + 1 + 1) + 1
= 7

这篇关于递归输出错误的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！