What's the point of this? Again, now that I can think about things recursively, I can similarly break things down into simpler versions of the same problem. It could be one version.

这些的意思是什么呢？再一次我想说,我既然能够以递归的方式思考了,那么我就可以简单地把问题,转化为更简单的同类问题。

麻省理工公开课 - 计算机科学及编程导论课程节选

Now. You might look at that and say, well that's just a lot like what we had over here Right? We had some additive constant plus a simpler version of the same problem reduced in size by 1.

现在你可能会看着这个说，这很像我们以前做过的,对不对？我们用一些附加的常量,加上问题的另外一个规模缩小了1的,简化版本来代替这个问题本身。

麻省理工公开课 - 计算机科学及编程导论课程节选

But I want to stress again, as long as I do the base case right and my inductive or recursive step reduces it to a smaller version of the same problem, the code will in fact converge and give me out an answer.

就开心的去做吧,但是我想再次强调,只要基础事件处理正确而我的递归,或递推步骤能把它简化为更简单的同类问题,那么这段代码就可以收敛。

麻省理工公开课 - 计算机科学及编程导论课程节选

I just reduced it to a smaller version of the same problem.

我刚刚把它简化为一个更小的同类问题,这就是我可以写出能解决更短字符串的例子。

麻省理工公开课 - 计算机科学及编程导论课程节选