Sync LeetCode submission Runtime - 1401 ms (40.49%), Memory - 30.5 MB (100.00%)

Author: jimit105

2263-maximum-running-time-of-n-computers/README.md

@@ -0,0 +1,42 @@
+<p>You have <code>n</code> computers. You are given the integer <code>n</code> and a <strong>0-indexed</strong> integer array <code>batteries</code> where the <code>i<sup>th</sup></code> battery can <strong>run</strong> a computer for <code>batteries[i]</code> minutes. You are interested in running <strong>all</strong> <code>n</code> computers <strong>simultaneously</strong> using the given batteries.</p>
+
+<p>Initially, you can insert <strong>at most one battery</strong> into each computer. After that and at any integer time moment, you can remove a battery from a computer and insert another battery <strong>any number of times</strong>. The inserted battery can be a totally new battery or a battery from another computer. You may assume that the removing and inserting processes take no time.</p>
+
+<p>Note that the batteries cannot be recharged.</p>
+
+<p>Return <em>the <strong>maximum</strong> number of minutes you can run all the </em><code>n</code><em> computers simultaneously.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2022/01/06/example1-fit.png" style="width: 762px; height: 150px;" />
+<pre>
+<strong>Input:</strong> n = 2, batteries = [3,3,3]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> 
+Initially, insert battery 0 into the first computer and battery 1 into the second computer.
+After two minutes, remove battery 1 from the second computer and insert battery 2 instead. Note that battery 1 can still run for one minute.
+At the end of the third minute, battery 0 is drained, and you need to remove it from the first computer and insert battery 1 instead.
+By the end of the fourth minute, battery 1 is also drained, and the first computer is no longer running.
+We can run the two computers simultaneously for at most 4 minutes, so we return 4.
+
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2022/01/06/example2.png" style="width: 629px; height: 150px;" />
+<pre>
+<strong>Input:</strong> n = 2, batteries = [1,1,1,1]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> 
+Initially, insert battery 0 into the first computer and battery 2 into the second computer. 
+After one minute, battery 0 and battery 2 are drained so you need to remove them and insert battery 1 into the first computer and battery 3 into the second computer. 
+After another minute, battery 1 and battery 3 are also drained so the first and second computers are no longer running.
+We can run the two computers simultaneously for at most 2 minutes, so we return 2.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= batteries.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= batteries[i] &lt;= 10<sup>9</sup></code></li>
+</ul>

2263-maximum-running-time-of-n-computers/solution.py

@@ -0,0 +1,20 @@
+# Approach 2: Binary Search
+
+class Solution:
+    def maxRunTime(self, n: int, batteries: List[int]) -> int:
+        left, right = 1, sum(batteries) // n
+
+        while left < right:
+            target = right - (right - left) // 2
+
+            extra = 0
+            for power in batteries:
+                extra += min(power, target)
+
+            if extra // n >= target:
+                left = target
+            else:
+                right = target - 1
+
+        return left
+