ava function 11

avafrohna · avafrohna · commit 877563fa16b0 · 2024-06-14T12:29:32.000+02:00
diff --git a/src/main/java/com/fishercoder/solutions/_11.java b/src/main/java/com/fishercoder/solutions/_11.java
@@ -1,4 +1,6 @@
 package com.fishercoder.solutions;
+import java.util.HashMap;
+import java.util.Map;
 
 public class _11 {
     public static class Solution1 {
@@ -23,21 +25,39 @@ public static class Solution2 {
          * Two pointer technique.
          * Well explained here: https://leetcode.com/problems/container-with-most-water/discuss/6100/Simple-and-clear-proofexplanation
          */
+        private static Map<String, Boolean> branchCoverage = new HashMap<>();
+
+        static {
+            branchCoverage.put("flag1", false);
+            branchCoverage.put("flag2", false);
+            branchCoverage.put("flag3", false);
+        }
+
         public int maxArea(int[] height) {
             int max = 0;
             int left = 0;
             int right = height.length - 1;
             while (left < right) {
+                branchCoverage.put("flag1", true);
                 max = Math.max(Math.min(height[left], height[right]) * (right - left), max);
                 if (height[left] <= height[right]) {
                     /**if this height is shorter, then we'll need to move it to the right to find a higher one so that it's possible to find a larger area.*/
+                    branchCoverage.put("flag2", true);
                     left++;
                 } else {
+                    branchCoverage.put("flag3", true);
                     right--;
                 }
             }
+            printCoverage();
             return max;
         }
+
+        public void printCoverage() {
+            for (Map.Entry<String, Boolean> entry : branchCoverage.entrySet()) {
+                System.out.println(entry.getKey() + " was " + (entry.getValue() ? "hit" : "not hit"));
+            }
+        }
     }
 
 }
