Leetcode 1785. Minimum Elements to Add to Form a Given Sum

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

解析：Version 1，根据题意，需要先数组求和，然后再求跟目标的差值，为了添加最少数量的数字，因此每次都应添加极限数值，题目变成了算除法并对余数取整。

• Version 1

class Solution:
    def minElements(self, nums: List[int], limit: int, goal: int) -> int:
        total = sum(nums)
        diff = goal - total
        count = ceil(abs(diff) / limit)
        return count

Reference

1. https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/