求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

>>阅读原文<<