leetcode3.27每日一题（2028. 找出缺失的观测数据）

lc的mid越来越像easy了。

class Solution {
public:
    vector<int> missingRolls(vector<int>& rolls, int mean, int n) {
        int s = 0;
        vector<int> answer;
        for(int roll:rolls) s += roll;
        s = mean * (rolls.size()+n) - s;

        if(s > n*6 || s < n) return answer;
        int num = s/n;
        int r = s%n;
        for(int i = 0;i<n;i++){
            if(i<r) answer.push_back(num+1);
            else answer.push_back(num);
        }
        return answer;
    }
};