Leetcode 2591. 将钱分给最多的儿童

class Solution {
public:
    int distMoney(int money, int children) {      
         if (money < children) {
            return -1;
        }        
        money = money - children;
        int num = money / 7;       
        if (num >= children) {                  //如果剩下的钱够给每个儿童分配7美元还有剩余
        if (money % 7 > 0 || money / 7 > children) {//为满足每一元都要分配把多余的钱分给一人
                return children - 1;
            }
            else {
                return children;
            }
        }       
        if (money - num * 7 == 3) {      //如果分给另一个儿童的钱是三美元且其余儿童都分配了七美元结果减一
            if (num + 1 == children) {
                return num - 1;
            }
        }       
        return num;
    }
};

class Solution {
public:
    int distMoney(int money, int children) {
        if (money < children) {
            return -1;
        }
        money -= children;
        int cnt = min(money / 7, children);
        money -= cnt * 7;
        children -= cnt;
        if ((children == 0 && money > 0) || (children == 1 && money == 3)) {
            cnt--;
        }
        return cnt;
    }
};