Straightforward Greedy Algo
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nCalculate the diff betw
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nCalculate the diff between goal and current sum. Number of additional elements = diff/limit\n\n# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python []\nclass Solution(object):\n    def minElements(self, nums, limit, goal):\n        """\n        :type nums: List[int]\n        :type limit: int\n        :type goal: int\n        :rtype: int\n        """\n        \n\n        diff = abs(goal - sum(nums))\n\n        if diff % limit == 0:\n            return diff//limit\n        else:\n            return diff//limit + 1\n\n\n```
['Greedy', 'Python']