mirror of
https://github.com/mx42/adventofcode.git
synced 2026-01-14 05:49:52 +01:00
13 lines
310 B
Haskell
13 lines
310 B
Haskell
import Data.List
|
|
|
|
day1steps :: [Char] -> [Int]
|
|
day1steps xs = [if x == '(' then 1 else -1 | x <- xs]
|
|
|
|
day1p1 :: [Char] -> Int
|
|
day1p1 xs = sum(day1steps xs)
|
|
|
|
day1p2 :: [Char] -> Maybe Int
|
|
day1p2 xs = findIndex (== entrance) steps
|
|
where steps = scanl (\acc x -> acc + x) 0 (day1steps xs)
|
|
entrance = -1
|