Day 1 finished

Author: cvanlabe

Day1/1pt1.py

@@ -0,0 +1,24 @@
+
+
+def fetch_input(input_file):
+    with open(input_file, 'r') as f:
+        numbers = f.readlines()
+
+    numbers = [int(number.strip()) for number in numbers]
+    return numbers
+
+
+def main():
+    numbers = fetch_input('input_files/1.txt')
+    highest = numbers[0]
+    increases = 0
+    for number in numbers:
+        if number > highest:
+            increases += 1
+        highest = number
+
+    print(increases)
+
+
+if __name__ == "__main__":
+    main()

Day1/1pt2.py

@@ -0,0 +1,32 @@
+
+
+def fetch_input(input_file):
+    with open(input_file, 'r') as f:
+        numbers = f.readlines()
+
+    numbers = [int(number.strip()) for number in numbers]
+    return numbers
+
+
+def main():
+    numbers = fetch_input('input_files/1.txt')
+    amount_of_numbers = len(numbers)
+    window_sums = []
+
+    for i in range(amount_of_numbers):
+        if i <= amount_of_numbers - 3:
+            # Fill the new list with the sums of the 3-sized window
+            window_sums.append(int(numbers[i]) + int(numbers[i+1]) + int(numbers[i+2]))
+
+    highest = window_sums[0]
+    increases = 0
+    for number in window_sums:
+        if int(number) > highest:
+            increases += 1
+        highest = int(number)
+
+    print(increases)
+
+
+if __name__ == "__main__":
+    main()

Day1/input_files/1_test.txt

@@ -0,0 +1,10 @@
+199
+200
+208
+210
+200
+207
+240
+269
+260
+263

README.md

@@ -1 +1,5 @@
-# Advent-of-Code-2021
+# Advent-of-Code-2021
+
+Cool puzzle, datastructure and algorithm challenge I'm trying out as a "competition with myself" whenever there is time for it... .
+
+