0
点赞
收藏
分享

微信扫一扫

leetcode每日-2022.03-27-2028. 找出缺失的观测数据

村里搬砖的月野兔 2022-03-27 阅读 40
leetcode
class Solution {
public:
    vector<int> missingRolls(vector<int>& rolls, int mean, int n) {
        int sums = mean * (n + rolls.size());
        vector<int> v;
        for (int i = 0; i < rolls.size(); ++i) sums -= rolls[i];
        if (sums < n || sums > 6 * n) return {};
        for (int i = 0; i < n; ++i) v.push_back(sums/n);
        for (int i = 0; i < sums%n; ++i) v[i]++;
        return v;
    }
};
举报

相关推荐

0 条评论