容易的递归

简单的递归int route 1?private int recursion(int n){??? if(n 1)??????? return route//递归出口?

简单的递归

int route = 1;?
private int recursion(int n)
{
??? if(n < 1)
??????? return route;//递归出口
??? return n?* recursion(n-1);
}

?

?

?


?

?