python C++速解Leetcode算術題2028 Find Missing Observations

python C++速解Leetcode算術題2028  Find Missing Observations

[Python code請進]

[codes on Leetcode]https://leetcode.com/problems/find-missing-observations/solutions/5738735/sum-multiplication-substract-division-with-remainder-1-line73ms-beats-9779/

[Leetcode Playlist]https://www.youtube.com/watch?v=B1GQlUN08lk&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

class Solution:
    def missingRolls(self, rolls: List[int], mean: int, n: int) -> List[int]:
        m=len(rolls)
        sum_rolles=sum(rolls)
        total=(n+m)*mean
        miss=total-sum_rolles
        if miss>6*n or miss<n: return []
        q,r=divmod(miss, n)
        return [q+1]*r+[q]*(n-r)