Runtime: 143 ms (Top 19.44%) | Memory: 114.3 MB (Top 55.56%)

Author: AnasImloul

scripts/algorithms/M/Maximum Building Height/Maximum Building Height.java

@@ -1,3 +1,4 @@
+// Runtime: 143 ms (Top 19.44%) | Memory: 114.3 MB (Top 55.56%)
 class Solution {
     public int maxBuilding(int n, int[][] restrictions) {
         List<int[]> list=new ArrayList<>();
@@ -6,35 +7,35 @@ public int maxBuilding(int n, int[][] restrictions) {
             list.add(restriction);
         }
         Collections.sort(list,new IDSorter());
-        
+
         if(list.get(list.size()-1)[0]!=n){
             list.add(new int[]{n,n-1});
         }
-            
+
        for(int i=1;i<list.size();i++){
            list.get(i)[1]=Math.min(list.get(i)[1],list.get(i-1)[1] + list.get(i)[0]-list.get(i-1)[0]);
        }
-        
+
        for(int i=list.size()-2;i>=0;i--){
            list.get(i)[1]=Math.min(list.get(i)[1],list.get(i+1)[1] + list.get(i+1)[0] - list.get(i)[0]);
-       } 
-        
+       }
+
        int result=0;
        for(int i=1;i<list.size();i++){
-           int h1=list.get(i-1)[1];  // heigth of previous restriction
-           int h2=list.get(i)[1];   // height of current restriction
+           int h1=list.get(i-1)[1]; // heigth of previous restriction
+           int h2=list.get(i)[1]; // height of current restriction
            int x=list.get(i-1)[0]; // id of previous restriction
-           int y=list.get(i)[0];   // id of current restriction
-       
+           int y=list.get(i)[0]; // id of current restriction
+
           result=Math.max(result,Math.max(h1,h2) + (y-x-Math.abs(h1-h2))/2);
-       } 
+       }
         return result;
     }
-    
+
     public class IDSorter implements Comparator<int[]>{
         @Override
         public int compare(int[] myself,int[] other){
             return myself[0]-other[0];
-        } 
+        }
     }
-}
+}