<span style="font-size:24px;">1、从1加到100</span>
int plus(int n){
if (n == 1) {
return 1;
}
return plus (n-1)+n;
}
在void start中添加Debug.Log(plus(100));
运行会输出5050.
2、递归解汉诺塔
void hannou(string a,string b,string c,int n)
{
if (n == 1) {
Debug.Log (a + "--->" + c);
} else
{
hannou(a,c,b,n-1);
hannou(a,b,c,1);
hannou (b,a,c,n-1);
}
}
在void start中添加hannou("T1","T2","T3",6);运行可输出正确结果。