26 lines
771 B
Haskell
26 lines
771 B
Haskell
|
import Data.List
|
||
|
|
import Data.Char
|
||
|
|
|
||
|
|
wordDict = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
|
||
|
|
|
||
|
|
findFirst :: String -> [String] -> Int
|
||
|
|
findFirst [] _ = 0
|
||
|
|
findFirst s@(x:xs) wordDict
|
||
|
|
| isDigit x = read [x]
|
||
|
|
| Just y <- elemIndex (take 3 s) wordDict = y -- not needed for exercise 1
|
||
|
|
| Just y <- elemIndex (take 4 s) wordDict = y -- not needed for exercise 1
|
||
|
|
| Just y <- elemIndex (take 5 s) wordDict = y -- not needed for exercise 1
|
||
|
|
| otherwise = findFirst xs wordDict
|
||
|
|
|
||
|
|
findLast s wordDict = findFirst (reverse s) (map reverse wordDict)
|
||
|
|
|
||
|
|
main :: IO ()
|
||
|
|
main = do
|
||
|
|
inputLines <- lines <$> getContents
|
||
|
|
|
||
|
|
let intList = map (\x -> findFirst x wordDict * 10 + findLast x wordDict) inputLines
|
||
|
|
let result = sum intList
|
||
|
|
|
||
|
|
print result
|
||
|
|
|