sln_2016_01

Copyright	(c) Eric Mertens 2021
License	ISC
Maintainer	emertens@gmail.com
Safe Haskell	None
Language	Haskell2010

Main

Description

https://adventofcode.com/2016/day/1

Synopsis

data D
- = DL
- | DR
main :: IO ()
part1 :: [Coord] -> Int
part2 :: [Coord] -> Maybe Int
computePath :: [(D, Int)] -> [Coord]
duplicate :: Ord a => [a] -> Maybe a
toSteps :: Coord -> [(D, Int)] -> [Coord]
turn :: D -> Coord -> Coord

Documentation

data D Source #

Constructors

DL
DR

main :: IO () Source #

>>> :main
241
Just 116

part1 :: [Coord] -> Int Source #

Given a list of steps determine the ultimate Manhattan-distance from the starting position.

part2 :: [Coord] -> Maybe Int Source #

computePath :: [(D, Int)] -> [Coord] Source #

duplicate :: Ord a => [a] -> Maybe a Source #

Find the first duplicate element in a list

toSteps Source #

Arguments

:: Coord	initial direction
-> [(D, Int)]	commands
-> [Coord]	list of directions

Compute steps taken by following a list of commands

turn :: D -> Coord -> Coord Source #