Add leetcode problem 2929

Author: lht102

leetcode/src/02929_distribute_candies_among_children_ii/__init__.py

@@ -0,0 +1,8 @@
+class Solution:
+    def distributeCandies(self, n: int, limit: int) -> int:
+        acc = 0
+        [
+            acc := acc + max(min(limit, n - i) - max(0, n - i - limit) + 1, 0)
+            for i in range(min(n, limit) + 1)
+        ]
+        return acc

leetcode/src/02929_distribute_candies_among_children_ii/solution.py

@@ -0,0 +1,13 @@
+import unittest
+from .solution import Solution
+
+
+class TestTwoSum(unittest.TestCase):
+    def test_distributeCandies(self):
+        s = Solution()
+        self.assertEqual(s.distributeCandies(5, 2), 3)
+        self.assertEqual(s.distributeCandies(3, 3), 10)
+
+
+if __name__ == "__main__":
+    unittest.main()