求n的阶乘(不考虑溢出)

(1)非递归方式(循环方式) #include <stdio.h> #include <stdlib.h> int Factor(int n){ int result = 1; for (int i = 1; i <= n; ++i){ result = i; } return result; } int main(){ printf("%d\n", Factor(5)); system(“pau

>>阅读原文<<