g2901_3000.s2928_distribute_candies_among_children_i.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
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g2901_3000.s2928_distribute_candies_among_children_i;
// #Easy #Math #Enumeration #Combinatorics #2023_12_29_Time_1_ms_(98.72%)_Space_40.9_MB_(6.45%)
public class Solution {
public int distributeCandies(int n, int limit) {
int count = 0;
for (int i = 0; i < Math.min(limit, n) + 1; i++) {
for (int j = 0; j < Math.min(limit, n) + 1; j++) {
int k = n - i - j;
if (k >= 0 && k <= limit) {
count++;
}
}
}
return count;
}
}