fuxino/project-euler-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update Haskell solution for Problem 14

Browse Source
This commit is contained in:
daniele 2024-11-10 11:17:37 +01:00
parent f9aa2edbd2
commit dcf2d68b0e
Signed by: fuxino
GPG Key ID: 981A2B2A3BBF5514
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Haskell/p014.hs
View File

@ -15,10 +15,10 @@
-- NOTE: Once the chain starts the terms are allowed to go above one million.
collatz :: (Integral a) => a -> [a]
collatz 1 = [1]
collatz n
| n == 1 = [1]
| n `mod` 2 == 0 = n:(collatz $ n `div` 2)
| otherwise = n:(collatz $ 3 * n + 1)
| even n = n:(collatz $ n `div` 2)
| odd n = n:(collatz $ 3 * n + 1)
maxCollatzLength :: Int -> Int
maxCollatzLength n = snd $ maximum $ zip [ length (collatz x) | x <- [1..n-1] ] [1..n-1]