g2501_2600.s2591_distribute_money_to_maximum_children.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g2501_2600.s2591_distribute_money_to_maximum_children;

// #Easy #Math #Greedy #2023_08_23_Time_1_ms_(100.00%)_Space_40.7_MB_(71.47%)

/**
 * 2591 - Distribute Money to Maximum Children\.
 *
 * Easy
 *
 * You are given an integer `money` denoting the amount of money (in dollars) that you have and another integer `children` denoting the number of children that you must distribute the money to.
 *
 * You have to distribute the money according to the following rules:
 *
 * *   All money must be distributed.
 * *   Everyone must receive at least `1` dollar.
 * *   Nobody receives `4` dollars.
 *
 * Return _the **maximum** number of children who may receive **exactly**_ `8` _dollars if you distribute the money according to the aforementioned rules_. If there is no way to distribute the money, return `-1`.
 *
 * **Example 1:**
 *
 * **Input:** money = 20, children = 3
 *
 * **Output:** 1
 *
 * **Explanation:** The maximum number of children with 8 dollars will be 1. One of the ways to distribute the money is: 
 * - 8 dollars to the first child. 
 * - 9 dollars to the second child. 
 * - 3 dollars to the third child. 
 *
 * It can be proven that no distribution exists such that number of children getting 8 dollars is greater than 1.
 *
 * **Example 2:**
 *
 * **Input:** money = 16, children = 2
 *
 * **Output:** 2
 *
 * **Explanation:** Each child can be given 8 dollars.
 *
 * **Constraints:**
 *
 * *   `1 <= money <= 200`
 * *   `2 <= children <= 30`
**/
public class Solution {
    public int distMoney(int money, int children) {
        if (money < children) {
            return -1;
        }
        if (money < children + 7) {
            return 0;
        }
        int numEighters = 0;
        money -= children;
        int possibleEighters = children;
        while (money >= 7 && possibleEighters > 0) {
            money -= 7;
            ++numEighters;
            --possibleEighters;
        }
        if ((money > 0 && possibleEighters == 0) || (money == 3 && possibleEighters == 1)) {
            --numEighters;
        }
        return numEighters;
    }
}