_1103.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_1103 {
publicstaticclassSolution1 {
publicint[] distributeCandies(intcandies, intnumPeople) {
Map<Integer, Integer> map = newHashMap<>();
intcandy = 1;
while (candies > 0) {
for (intperson = 1; person <= numPeople && candies > 0; person++, candy++) {
if (candies < candy) {
map.put(person, map.getOrDefault(person, 0) + candies);
candies -= candy;
break;
 } else {
map.put(person, map.getOrDefault(person, 0) + candy);
candies -= candy;
 }
 }
 }
int[] result = newint[numPeople];
for (inti = 1; i <= numPeople; i++) {
if (map.containsKey(i)) {
result[i - 1] = map.get(i);
 } else {
result[i - 1] = 0;
 }
 }
returnresult;
 }
 }
}