Advent of Code 2020 (26 Part Series)

I’m going to keep this one short as I’ve run out of ways to make this interesting. Posting this for completeness.

The Challenge Part 1

Link to challenge on Advent of Code 2020 website

The challenge talks about a weird seating index scheme that uses binary partitioning. However, fancy words aside, they are literally talking about using binary.

One of the examples given was:

BFFFBBFRRR: row 70, column 7, seat ID 567

Enter fullscreen mode Exit fullscreen mode

ignoring the superfluous information about rows and columns (which don’t appear anywhere in the challenge), we just need to know how to convert BFFFBBFRRR into the number 567.

The only solution, really.

Basically it’s binary. if you replace all the B and R with 1, and the F and L with 0, then BFFFBBFRRR turns into 1000110111 which is 567 in binary.

We can do the converting into binary using some simple replace() functions, and then we can turn the ascii string into binary using python’s existing int(value, 2) function. The second argument being the base system.

So, quite simply:

int(entry.replace("B", "1").replace("F", "0").replace("R", "1").replace("L", "0"), 2)

Enter fullscreen mode Exit fullscreen mode

Will give you the seat number from any given string. We can quickly scan the input data using this and list comprehension:

seats = [int(entry.replace("B", "1").replace("F", "0").replace("R", "1").replace("L", "0"), 2) for entry in open("input.txt").readlines()]

Enter fullscreen mode Exit fullscreen mode

The first part of the question asks for the highest seat number in the list. We simply have to do max(seats) to find out

print("highest seat", max(seats))

Enter fullscreen mode Exit fullscreen mode

The Challenge Part 2

The second part of the question says that there is a missing seat somewhere in the middle, but to also ignore the missing seats at either end of the range. We can use set comprehension again for this:

print("my seat", set(range(min(seats), max(seats))).difference(seats))

Enter fullscreen mode Exit fullscreen mode

Tadaa!
Onwards!

Advent of Code 2020 (26 Part Series)

原文链接：Advent of Code 2020: Day 05 with Python

文章版权声明 1、本网站名称：拾光赋
2、本站永久网址：https://www.blogs.ink
3、本网站的文章部分内容可能来源于网络，仅供大家学习与参考，如有侵权，请联系站长QQ：805375623进行删除处理。
4、本站一切资源不代表本站立场，并不代表本站赞同其观点和对其真实性负责。
5、本站一律禁止以任何方式发布或转载任何违法的相关信息，访客发现请向站长举报
6、本站资源大多存储在云盘，如发现链接失效，请联系我们我们会第一时间更新。

THE END