# 普通遍历def f1(n): r = 1 while n > 1: r *= n n -= 1 return r# 递归def f2(n): if n == 1: return 1 else: return n * f2(n - 1)if __name__ == '__main__': print(f1(6)) print(f2(6))
