Sync LeetCode submission Runtime - 4656 ms (9.59%), Memory - 18 MB (15.75%)

Author: jimit105

3201-distribute-candies-among-children-ii/README.md

@@ -0,0 +1,28 @@
+<p>You are given two positive integers <code>n</code> and <code>limit</code>.</p>
+
+<p>Return <em>the <strong>total number</strong> of ways to distribute </em><code>n</code> <em>candies among </em><code>3</code><em> children such that no child gets more than </em><code>limit</code><em> candies.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 5, limit = 2
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> There are 3 ways to distribute 5 candies such that no child gets more than 2 candies: (1, 2, 2), (2, 1, 2) and (2, 2, 1).
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> n = 3, limit = 3
+<strong>Output:</strong> 10
+<strong>Explanation:</strong> There are 10 ways to distribute 3 candies such that no child gets more than 3 candies: (0, 0, 3), (0, 1, 2), (0, 2, 1), (0, 3, 0), (1, 0, 2), (1, 1, 1), (1, 2, 0), (2, 0, 1), (2, 1, 0) and (3, 0, 0).
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 10<sup>6</sup></code></li>
+	<li><code>1 &lt;= limit &lt;= 10<sup>6</sup></code></li>
+</ul>

3201-distribute-candies-among-children-ii/solution.py

@@ -0,0 +1,14 @@
+# Approach 1: Enumeration
+
+# Time: O(min(limit, n))
+# Space: O(1)
+
+class Solution:
+    def distributeCandies(self, n: int, limit: int) -> int:
+        ans = 0
+        for i in range(min(limit, n) + 1):
+            if n - i > 2 * limit:
+                continue
+            ans += min(n - i, limit) - max(0, n - i - limit) + 1
+        return ans
+