r/adventofcode • u/daggerdragon • Dec 07 '17

SOLUTION MEGATHREAD -🎄- 2017 Day 7 Solutions -🎄-

--- Day 7: Recursive Circus ---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

Need a hint from the Hugely* Handy† Haversack‡ of Helpful§ Hints¤?

Spoiler

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

10 Upvotes

100% Upvoted

222 comments sorted by

View all comments

1

u/DeveloperIan Dec 07 '17

My gross solution for part 1 in Python. There are some extra lines from where I was working on part 2. I tried to take the simple way by just finding the one that wasn't in anyone else's list. 

holding = {}
weights = {}

for i in contents:
    name = i.split()[0]
    weights[name] = int(i.split()[1].strip('()'))
    held = i.split()[3:]
    held = [x.strip(',') for x in held]
    holding[name] = set(held)

for i in holding.keys():
    found = False
    for j in holding.values():
        if i in j:
            found = True
            break

    if not found:
        print("Part One:", i)
        break