add 1103

fishercoder1534 · fishercoder1534 · commit 1867c70029a6 · 2020-02-02T14:04:33.000-08:00
diff --git a/README.md b/README.md
@@ -63,6 +63,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | |Easy||
 |1119|[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) |  [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw)|Easy||
 |1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) |  [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk)|Easy||
+|1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | |Easy|Math|
 |1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) |  [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI)|Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | |Easy||
 |1086|[High Five](https://leetcode.com/problems/high-five/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1103.java b/src/main/java/com/fishercoder/solutions/_1103.java
@@ -0,0 +1,68 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * 1103. Distribute Candies to People
+ *
+ * We distribute some number of candies, to a row of n = num_people people in the following way:
+ * We then give 1 candy to the first person, 2 candies to the second person, and so on until we give n candies to the last person.
+ * Then, we go back to the start of the row, giving n + 1 candies to the first person, n + 2 candies to the second person,
+ * and so on until we give 2 * n candies to the last person.
+ * This process repeats (with us giving one more candy each time, and moving to the start of the row
+ * after we reach the end) until we run out of candies.
+ * The last person will receive all of our remaining candies (not necessarily one more than the previous gift).
+ * Return an array (of length num_people and sum candies) that represents the final distribution of candies.
+ *
+ * Example 1:
+ * Input: candies = 7, num_people = 4
+ * Output: [1,2,3,1]
+ * Explanation:
+ * On the first turn, ans[0] += 1, and the array is [1,0,0,0].
+ * On the second turn, ans[1] += 2, and the array is [1,2,0,0].
+ * On the third turn, ans[2] += 3, and the array is [1,2,3,0].
+ * On the fourth turn, ans[3] += 1 (because there is only one candy left), and the final array is [1,2,3,1].
+ *
+ * Example 2:
+ * Input: candies = 10, num_people = 3
+ * Output: [5,2,3]
+ * Explanation:
+ * On the first turn, ans[0] += 1, and the array is [1,0,0].
+ * On the second turn, ans[1] += 2, and the array is [1,2,0].
+ * On the third turn, ans[2] += 3, and the array is [1,2,3].
+ * On the fourth turn, ans[0] += 4, and the final array is [5,2,3].
+ *
+ * Constraints:
+ * 1 <= candies <= 10^9
+ * 1 <= num_people <= 1000
+ * */
+public class _1103 {
+    public static class Solution1 {
+        public int[] distributeCandies(int candies, int num_people) {
+            Map<Integer, Integer> map = new HashMap<>();
+            int candy = 1;
+            while (candies > 0) {
+                for (int person = 1; person <= num_people && 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 = new int[num_people];
+            for (int i = 1; i <= num_people; i++) {
+                if (map.containsKey(i)) {
+                    result[i - 1] = map.get(i);
+                } else {
+                    result[i - 1] = 0;
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1103Test.java b/src/test/java/com/fishercoder/_1103Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1103;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1103Test {
+    private static _1103.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1103.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{1, 2, 3, 1}, solution1.distributeCandies(7, 4));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{5, 2, 3}, solution1.distributeCandies(10, 3));
+    }
+
+    @Test
+    public void test3() {
+        assertArrayEquals(new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 5, 0, 0, 0, 0, 0}, solution1.distributeCandies(600, 40));
+    }
+
+}
