Improve year 2022 day8

Author: linl33

year2022/src/main/java/dev/linl33/adventofcode/year2022/Day8.java

@@ -64,11 +64,7 @@ public Integer part1(@NotNull BufferedReader reader) {
         if (curr > max) {
           max = curr;
           maxY = y;
-
-          if (!visible[x + y * cols]) {
-            visible[x + y * cols] = true;
-            visibleTrees++;
-          }
+          visibleTrees += visible[x + y * cols] ? 0 : 1;
         }
       }
 
@@ -78,10 +74,7 @@ public Integer part1(@NotNull BufferedReader reader) {
         var curr = input[y].charAt(x);
         if (curr > max) {
           max = curr;
-          if (!visible[x + y * cols]) {
-            visible[x + y * cols] = true;
-            visibleTrees++;
-          }
+          visibleTrees += visible[x + y * cols] ? 0 : 1;
         }
       }
     }
@@ -129,7 +122,7 @@ public Integer part2(@NotNull BufferedReader reader) {
         // look left
         score *= treeX - backRef[treeX];
 
-        var maxPotential = (((rows - 1) / 2) * ((rows - 1) - (rows - 1) / 2)) * score;
+        var maxPotential = (treeY - colBackRef[colBackRefPointer]) * ((rows - 1) - treeY) * score;
         if (maxPotential <= max) {
           skippedColumns[treeY] = true;
           continue;