Advent_of_Code/AdventOfCode2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

13-1 grrr2

Browse Source
This commit is contained in:
Martin Kayser
2023-12-13 18:48:58 +01:00
parent 22876cd65a
commit 6a2336c02a
2 changed files with 15 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
13/13-1.py
View File

@@ -21,22 +21,28 @@ for i in range(len(data)):
print("================")
'''
def find_vertikal_mirror(matrix):
#print(type(matrix), matrix)
#print(type(matrix[0]), matrix[0], len(matrix[0]))
for s in range(1, len(matrix[0])):
#print((len(matrix[0])))
is_mirror = True
for z in matrix:
#print("z",z)
if s <= len(z) / 2:
p1 = z[:s]
p2 = z[s:]
p2 = p2[::-1]
p2 = p2[:s]
print("1: ",s,p1,"-",p2)
p2 = p2[::-1]
# print("1: ",s,p1,"__",p2)
else:
p2 = z[s:]
p1 = z[:s]
p1 = p1[::-1]
p1 = p1[:len(p2)]
print("2: ",s,p1,p2)
# print("2: ",s,p1,p2)
if p1 != p2:
is_mirror = False
if is_mirror:
@@ -47,24 +53,22 @@ def find_vertikal_mirror(matrix):
def find_horizontal_mirror(matrix):
new_matrix = []
for j in range(len(matrix[0])):
new_matrix.append("".join([matrix[k][j] for k in range(len(matrix))]))
for n in new_matrix:
print(n)
new_matrix.append("".join([matrix[k][j] for k in range(len(matrix)-1,-1,-1)]))
#for n in new_matrix:
# print(n)
print("_____________________")
return find_vertikal_mirror(new_matrix)
solution = 0
for m in data:
print(m)
#print(m)
for mn in m:
print(mn)
vert = find_vertikal_mirror(m)
horz = find_horizontal_mirror(m)
print(vert, horz)
if vert == 0:
solution += 100 * find_horizontal_mirror(m)
else:
solution += vert
solution += 100 * find_horizontal_mirror(m)
solution += vert
print("Lösung:", solution)