add 1482

fishercoder1534 · fishercoder1534 · commit 55f4dabc4d8c · 2021-11-10T09:19:07.000-08:00
diff --git a/README.md b/README.md
@@ -249,6 +249,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1487|[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | |Medium|HashTable, String|
 |1486|[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) | |Medium|Array, Bit Manipulation|
 |1485|[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java) | |Medium|HashTable, Tree, DFS, BFS|
+|1482|[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java) | |Medium|Array, Binary Search|
 |1481|[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) | |Medium|Array, Sort|
 |1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp)| |Easy|Array|
 |1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1482.java b/src/main/java/com/fishercoder/solutions/_1482.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+public class _1482 {
+    public static class Solution1 {
+        /**
+         * https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/discuss/686316/JavaC%2B%2BPython-Binary-Search
+         */
+        public int minDays(int[] bloomDay, int m, int k) {
+            int n = bloomDay.length;
+            int left = 1;
+            int right = Integer.MAX_VALUE;
+            if (m * k > n) {
+                return -1;
+            }
+            while (left < right) {
+                int mid = left + (right - left) / 2;
+                int flower = 0;
+                int bouq = 0;
+                for (int j = 0; j < n; j++) {
+                    if (bloomDay[j] > mid) {
+                        flower = 0;
+                    } else if (++flower >= k) {
+                        bouq++;
+                        flower = 0;
+                    }
+                }
+                if (bouq < m) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+            return left;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1482Test.java b/src/test/java/com/fishercoder/_1482Test.java
@@ -0,0 +1,48 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1482;
+import com.fishercoder.solutions._2024;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1482Test {
+    private static _1482.Solution1 solution1;
+    private static int expected;
+    private static int[] bloomDay;
+    private static int m;
+    private static int k;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1482.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        expected = 3;
+        bloomDay = new int[]{1, 10, 3, 10, 2};
+        m = 3;
+        k = 1;
+        assertEquals(expected, solution1.minDays(bloomDay, m, k));
+    }
+
+    @Test
+    public void test2() {
+        expected = -1;
+        bloomDay = new int[]{1, 10, 3, 10, 2};
+        m = 3;
+        k = 2;
+        assertEquals(expected, solution1.minDays(bloomDay, m, k));
+    }
+
+    @Test
+    public void test3() {
+        expected = 9;
+        bloomDay = new int[]{1, 10, 2, 9, 3, 8, 4, 7, 5, 6};
+        m = 4;
+        k = 2;
+        assertEquals(expected, solution1.minDays(bloomDay, m, k));
+    }
+}
