Last active
January 5, 2016 16:23
-
-
Save ghaiklor/d4016f47b8091aab5cc6 to your computer and use it in GitHub Desktop.
Advent of Code (Day 9 Part 1)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const fs = require('fs'); | |
const INPUT = fs.readFileSync('./input.txt', 'utf-8').split('\n'); | |
const DIRECTION_REGEX = /(\w+) to (\w+) = (\d+)/; | |
// Takes input and builds map of all possible distances between two points | |
const buildDistanceMap = input => { | |
const map = new Map(); | |
input.forEach(direction => { | |
const parsed = direction.match(DIRECTION_REGEX); | |
map.set(`${parsed[1]} -> ${parsed[2]}`, +parsed[3]); | |
map.set(`${parsed[2]} -> ${parsed[1]}`, +parsed[3]); | |
}); | |
return map; | |
}; | |
// Takes input and builds unique set of all places that need to be visited | |
const buildPlacesSet = input => { | |
const places = new Set(); | |
input.forEach(direction => { | |
const parsed = direction.match(DIRECTION_REGEX); | |
places.add(parsed[1]).add(parsed[2]); | |
}); | |
return places; | |
}; | |
// Takes an array of items and builds an array with all possible permutations | |
const permute = input => { | |
const array = Array.from(input); | |
const permute = (res, item, key, arr) => { | |
return res.concat(arr.length > 1 && arr.slice(0, key).concat(arr.slice(key + 1)).reduce(permute, []).map(perm => [item].concat(perm)) || item); | |
}; | |
return array.reduce(permute, []); | |
}; | |
const distances = buildDistanceMap(INPUT); | |
const places = buildPlacesSet(INPUT); | |
const allPossibleRoutes = permute(places); | |
// Builds an array with all possible distances | |
const allPossibleDistances = allPossibleRoutes.reduce((acc, route) => { | |
let total = 0; | |
for (let i = 0; i < route.length; i++) { | |
if (route[i + 1] === undefined) break; | |
total += distances.get(`${route[i]} -> ${route[i + 1]}`); | |
} | |
return acc.concat([total]); | |
}, []); | |
const result = Math.min.apply(Math, allPossibleDistances); | |
console.log(result); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment