Minimum Elements to Add to Form a Given Sum — LeetCode 1785 Python Solution

The problem

You are given an integer array nums and two integers limit and goal. The array nums has an interesting property that abs(nums[i]) <= limit.

Example

Input

nums = [1,-1,1], limit = 3, goal = -4

Output

2

Explanation

You can add -2 and -3, then the sum of the array will be 1 - 1 + 1 - 2 - 3 = -4.

Python solution

class Solution:
    def minElements(self, nums: List[int], limit: int, goal: int) -> int:
        d = abs(sum(nums) - goal)
        return (d + limit - 1) // limit

Complexity

Pattern: Greedy

Take the locally best option every time — when you can prove that never costs you later. LeetCode 1785. Minimum Elements to Add to Form a Given Sum is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Greedy.

The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.

Related problems