[Python] 功課好難做 求救

thank you ching, 明曬 連登唯一好人

係WO
你啱
傻豬豬左

btw 樓主呢題 factorial
一個 for loop O(n) 已經搞掂啦
上面用兩個果班
我俾個 n = 1000000 你點行？

題目幅圖睇唔到？

Doesn't work if n == 0.

Also this has an unnecessary time complexity of O(n^2) when you can do it in O(n) by simply moving x outside the first loop and append the result of x*i.

死圖

主要既嘢得1行
簡簡單單咪得，寫咁複雜做乜

唔跟足樓主功課指引
自己參透下

算唔算dynamic programming

應該算係
樓主份功課唔比用？

其實就係簡單嘅memoization啫

Recursion

你朋友應該本身有天份

當連登係google?