refactor 325

fishercoder1534 · fishercoder1534 · commit 2b6d01b3bfda · 2021-09-29T07:33:39.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_325.java b/src/main/java/com/fishercoder/solutions/_325.java
@@ -6,6 +6,10 @@
 public class _325 {
 
     public static class Solution1 {
+        /**
+         * 1. This is a beautiful and classic solution that combines prefix sum and hashmap for quick search;
+         * 2. This actually covers all possible cases and could find the maximum array size
+         */
         public int maxSubArrayLen(int[] nums, int k) {
             Map<Integer, Integer> map = new HashMap();
             int sum = 0;
