The recursive C code is return num * factorial(num - 1).
递归的 C 代码是 return num * factorial(num - 1)。
That remainder is compared to 0 (it is the remainder 0 and, thus, num is divisible by 3).
该余数与 0 比较(如果余数是 0,那么该数可以被 3 整除)。
So again, I put in numcalls this num calls, which you can ignore.
所以再一次我会加上,这个,你们可以忽略这个。
应用推荐