about summary refs log tree commit diff
path: root/Day3.cs
diff options
context:
space:
mode:
authorBen Harris <ben@tilde.team>2020-12-02 00:36:24 -0500
committerBen Harris <ben@tilde.team>2020-12-02 00:36:24 -0500
commit36bb28af87e81a9b3cab1abd79d11106cd610f6c (patch)
treed4648bba69ceb5e20753acf54df51d74cff4731b /Day3.cs
parent00c3b51b897c33210679de546eebcd9ec75247a1 (diff)
update gitignore and run resharper cleanup
Diffstat (limited to 'Day3.cs')
-rw-r--r--Day3.cs22
1 files changed, 15 insertions, 7 deletions
diff --git a/Day3.cs b/Day3.cs
index 6bdf8ea..12f10d4 100644
--- a/Day3.cs
+++ b/Day3.cs
@@ -6,8 +6,6 @@ namespace aoc2019
 {
     internal sealed class Day3 : Day
     {
-        public override int DayNumber => 3;
-
         private readonly IEnumerable<(int, int)> intersections;
         private readonly List<Dictionary<(int, int), int>> wires;
 
@@ -17,6 +15,8 @@ namespace aoc2019
             intersections = wires[0].Keys.Intersect(wires[1].Keys);
         }
 
+        public override int DayNumber => 3;
+
         public override string Part1()
         {
             return $"{intersections.Min(x => Math.Abs(x.Item1) + Math.Abs(x.Item2))}";
@@ -38,14 +38,22 @@ namespace aoc2019
                 var d = int.Parse(step.Substring(1));
                 switch (step[0])
                 {
-                    case 'U': for (i = 0; i < d; i++) r.TryAdd((x, ++y), c++); break;
-                    case 'D': for (i = 0; i < d; i++) r.TryAdd((x, --y), c++); break;
-                    case 'R': for (i = 0; i < d; i++) r.TryAdd((++x, y), c++); break;
-                    case 'L': for (i = 0; i < d; i++) r.TryAdd((--x, y), c++); break;
+                    case 'U':
+                        for (i = 0; i < d; i++) r.TryAdd((x, ++y), c++);
+                        break;
+                    case 'D':
+                        for (i = 0; i < d; i++) r.TryAdd((x, --y), c++);
+                        break;
+                    case 'R':
+                        for (i = 0; i < d; i++) r.TryAdd((++x, y), c++);
+                        break;
+                    case 'L':
+                        for (i = 0; i < d; i++) r.TryAdd((--x, y), c++);
+                        break;
                 }
             }
 
             return r;
         }
     }
-}
+}
\ No newline at end of file