-
求從 10 到 100 中能被 3 或 5 整除數的加總。
sum [x | x <-[10..100], (mod x 3)==0 || (mod x 5)==0]
-
將一個字串倒序,不要使用反轉函數。
let rever' [] =[]; rever' (x:xs) = rever' xs ++ [x] in rever' "Hello World"
-
反轉一個Stack。 在Haskell,與處理list反轉相同邏輯。
Created
July 26, 2014 23:12
-
-
Save dz1984/2b7f7e77b24b2fe12ab6 to your computer and use it in GitHub Desktop.
練習使用Haskell解題。
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment