- Leetcode 1785. Minimum Elements
- 1785. 构成特定和需要添加的最少元素（难度：中等）
- quickselect方法找Medium
- LeetCode | 0530. 二叉搜索树的最小绝对差【Pyt
- LeetCode | 0783. 二叉搜索树节点最小距离【Pyt
- [Math_Medium]462. Minimum Moves
- Leetcode PHP题解--D107 453. Minimu
- 1266. Minimum Time Visiting All
- LeetCode 203 Remove Linked List
- 453. Minimum Moves to Equal Arra
文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
1. Description
Minimum Elements to Add to Form a Given Sum
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
网友评论