g3001_3100.s3074_apple_redistribution_into_boxes.Solution Maven / Gradle / Ivy

Go to download

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

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g3001_3100.s3074_apple_redistribution_into_boxes;

// #Easy #Array #Sorting #Greedy #2024_04_15_Time_1_ms_(99.81%)_Space_41.9_MB_(89.46%)

public class Solution {
    public int minimumBoxes(int[] apple, int[] capacity) {
        int[] count = new int[51];
        int appleSum = 0;
        for (int j : apple) {
            appleSum += j;
        }
        int reqCapacity = 0;
        int max = 0;
        for (int j : capacity) {
            count[j]++;
            max = Math.max(max, j);
        }
        for (int i = max; i >= 0; i--) {
            if (count[i] >= 1) {
                while (count[i] != 0) {
                    appleSum -= i;
                    reqCapacity++;
                    if (appleSum <= 0) {
                        return reqCapacity;
                    }
                    count[i]--;
                }
            }
        }
        return reqCapacity;
    }
}