Time: 23 ms (80.05%), Space: 55.1 MB (42.69%) - LeetHub

Author: dev-corp

0525-contiguous-array/0525-contiguous-array.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int findMaxLength(int[] nums) {
+        HashMap<Integer,Integer> map=new HashMap();
+        map.put(0,-1);
+        int sum=0,ans=0;
+        for(int i=0;i<nums.length;i++){
+            if(nums[i]==0) sum-=1;
+            else sum+=1;
+            if(map.containsKey(sum)) ans=Math.max(ans,i-map.get(sum));
+            else map.put(sum,i);
+        }
+        return ans;
+    }
+}