Python Greedy Solution Without using Loop
\nclass Solution:\n    def minElements(self, nums: List[int], limit: int, goal: int) -> int:\n        s = sum(nums)  \n        if s == goal :\n            retur
```\nclass Solution:\n    def minElements(self, nums: List[int], limit: int, goal: int) -> int:\n        s = sum(nums)  \n        if s == goal :\n            return 0 \n        val = abs(goal - s)\n        if val <= limit :\n            return 1 \n        q = val // limit \n        r = val % limit \n        if r == 0 :\n            return q \n        return q + 1 \n```
['Greedy', 'Python', 'Python3']