Time: 116 ms (25.36%), Space: 56.7 MB (44.98%) - LeetHub

py3-coder · py3-coder · commit c4dba6c8d190 · 2024-11-14T12:28:19.000+05:30
diff --git a/2064-minimized-maximum-of-products-distributed-to-any-store/2064-minimized-maximum-of-products-distributed-to-any-store.java b/2064-minimized-maximum-of-products-distributed-to-any-store/2064-minimized-maximum-of-products-distributed-to-any-store.java
@@ -1,33 +1,37 @@
 class Solution {
     public int minimizedMaximum(int n, int[] quantities) {
-        int maxi = Integer.MIN_VALUE;
+        
+        int maxi  = Integer.MIN_VALUE;
         for(int quantity : quantities){
-            maxi = Math.max(quantity , maxi) ;
+            maxi = Math.max(quantity,maxi);
         }
         
-        int ans=0;
-        int  l=1 , h = maxi;
-        while(l<=h){
-            int mid = l+(h-l)/2;
-            if(isPossible(n,mid,quantities)){
-                ans = mid;
-                h= mid-1;
+        //Edge Case ::
+        if(n == quantities.length){
+            return maxi ;
+        }
+  
+        int start = 1 ;
+        int end = maxi ;
+        int ans = Integer.MAX_VALUE;
+        while(start <= end ){
+            int mid = start +(end - start )/2;
+            if(isPossible(mid,quantities,n)){
+                ans = Math.min(mid , ans);
+                end = mid-1;
             }else{
-                l= mid+1;
+                start = mid+1;
             }
         }
         return ans ;
     }
     
-    public boolean isPossible(int n , int target , int[] quantities){
-        int cnt  = 0;
-        for(int ele : quantities){
-            if(ele%target == 0){
-                cnt += ele/target;
-            }else{
-                cnt += ele/target +1;
-            }
+    public static boolean isPossible(int mid , int[] quantities,int n){
+        int cnt=0;
+        for(int quantity : quantities){
+            cnt += Math.ceil(quantity*1.0/mid);
+            
         }
-        return cnt <= n ;
+        return cnt<=n;
     }
 }
