Commit 2d3000b

committed

Day 06: Solution of part 2

1 parent 68eb71f commit 2d3000bCopy full SHA for 2d3000b

File tree

+13

-7

lines changed

+13

-7

lines changed

Lines changed: 5 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -28,8 +28,6 @@ Given the recording in your puzzle input, what is the error-corrected version of`
`28`	`28`
`29`	`29`	`Your puzzle answer was nabgqlcw.`
`30`	`30`
`31`		`-The first half of this puzzle is complete! It provides one gold star: *`
`32`		`-`
`33`	`31`	`--- Part Two ---`
`34`	`32`
`35`	`33`	`Of course, that would be the message - if you hadn't agreed to use a modified repetition code instead.`
`@@ -38,4 +36,8 @@ In this modified code, the sender instead transmits what looks like random data,`
`38`	`36`
`39`	`37`	`In the above example, the least common character in the first column is a; in the second, d, and so on. Repeating this process for the remaining characters produces the original message, advent.`
`40`	`38`
`41`		`-Given the recording in your puzzle input and this new decoding methodology, what is the original message that Santa is trying to send?`
	`39`	`+Given the recording in your puzzle input and this new decoding methodology, what is the original message that Santa is trying to send?`
	`40`	`+`
	`41`	`+Your puzzle answer was ovtrjcjh.`
	`42`	`+`
	`43`	`+Both parts of this puzzle are complete! They provide two gold stars: **`

Lines changed: 7 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,8 @@ def __init__(self, nr):`
`7`	`7`	`super().__init__(nr)`
`8`	`8`	`self.length = 1`
`9`	`9`	`self.dicts = []`
`10`		`- self.message = ""`
	`10`	`+ self.message1 = ""`
	`11`	`+ self.message2 = ""`
`11`	`12`
`12`	`13`	`def calculate(self, test=False):`
`13`	`14`	`self.read_instructions()`
`@@ -28,9 +29,11 @@ def calc_message(self):`
`28`	`29`	`for line in self.input:`
`29`	`30`	`i = 0`
`30`	`31`	`for char in line:`
`31`		`- if i < self.length:`
	`32`	`+ if char.isalpha() andi < self.length:`
`32`	`33`	`self.dicts[i].add(char)`
`33`	`34`	`i += 1`
`34`	`35`	`for i in range(0, self.length):`
`35`		`- self.message += self.dicts[i].get_sorted_string_by_value_and_key(1)`
`36`		`- self.set_solution(1, self.message)`
	`36`	`+ self.message1 += self.dicts[i].get_sorted_string_by_value_and_key(1)`
	`37`	`+ self.message2 += self.dicts[i].get_sorted_string_by_value_and_key(1, True)`
	`38`	`+ self.set_solution(1, self.message1)`
	`39`	`+ self.set_solution(2, self.message2)`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,3 +25,4 @@ def test_1(self):`
`25`	`25`	`enarar"""`
`26`	`26`	`self.execute_test(test_input)`
`27`	`27`	`self.assertEqual("easter", self.solution.get_solution(1))`
	`28`	`+ self.assertEqual("advent", self.solution.get_solution(2))`

Comments

(0)