Runtime: 64 ms (Top 29.92%) | Memory: 46.6 MB (Top 92.25%)

Author: AnasImloul

scripts/algorithms/M/Maximal Rectangle/Maximal Rectangle.java

@@ -1,14 +1,15 @@
+// Runtime: 64 ms (Top 29.92%) | Memory: 46.6 MB (Top 92.25%)
 class Solution {
     public int maximalRectangle(char[][] matrix) {
         ArrayList<Integer> list = new ArrayList<>();
         int n = matrix[0].length;
         for(int i=0; i<n; i++){
             list.add(Character.getNumericValue(matrix[0][i]));
         }
-        
+
         int maxArea = maximumArea(list);
         int m = matrix.length;
-        
+
         for(int i=1; i<m; i++){
             for(int j=0; j<n; j++){
                 if(matrix[i][j] == '1'){
@@ -27,7 +28,7 @@ public int maximumArea(ArrayList<Integer> heights) {
         int[] left = new int[n];
         int[] right = new int[n];
         int[] width = new int[n];
-        
+
         for(int i=0; i<n; i++){
             while(!stack1.isEmpty() && heights.get(stack1.peek()) >= heights.get(i))
                 stack1.pop();
@@ -37,7 +38,7 @@ public int maximumArea(ArrayList<Integer> heights) {
                 left[i] = -1;
             stack1.push(i);
         }
-        
+
         for(int i=n-1; i>=0; i--){
             while(!stack2.isEmpty() && heights.get(stack2.peek()) >= heights.get(i))
                 stack2.pop();
@@ -47,14 +48,14 @@ public int maximumArea(ArrayList<Integer> heights) {
                 right[i] = n;
             stack2.push(i);
         }
-        
+
         for(int i=0; i<n; i++){
             width[i] = right[i] - left[i] - 1;
         }
         int mxArea = 0;
         for(int i=0; i<n; i++){
             mxArea = Math.max(mxArea, width[i] * heights.get(i));
-        }        
+        }
         return mxArea;
     }
-}
+}