Add solution and test-cases for problem 1482

Author: 0xff-dev

leetcode/1401-1500/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/README.md

@@ -0,0 +1,50 @@
+# [1482.Minimum Number of Days to Make m Bouquets][title]
+
+## Description
+You are given an integer array `bloomDay`, an integer `m` and an integer `k`.
+
+You want to make `m` bouquets. To make a bouquet, you need to use `k` **adjacent flowers** from the garden.
+
+The garden consists of `n` flowers, the i<sup>th</sup> flower will bloom in the `bloomDay[i]` and then can be used in **exactly one** bouquet.
+
+Return the minimum number of days you need to wait to be able to make `m` bouquets from the garden. If it is impossible to make m bouquets return `-1`.
+
+**Example 1:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 1
+Output: 3
+Explanation: Let us see what happened in the first three days. x means flower bloomed and _ means flower did not bloom in the garden.
+We need 3 bouquets each should contain 1 flower.
+After day 1: [x, _, _, _, _]   // we can only make one bouquet.
+After day 2: [x, _, _, _, x]   // we can only make two bouquets.
+After day 3: [x, _, x, _, x]   // we can make 3 bouquets. The answer is 3.
+```
+
+**Example 2:**
+
+```
+Input: bloomDay = [1,10,3,10,2], m = 3, k = 2
+Output: -1
+Explanation: We need 3 bouquets each has 2 flowers, that means we need 6 flowers. We only have 5 flowers so it is impossible to get the needed bouquets and we return -1.
+```
+
+**Example 3:**
+
+```
+Input: bloomDay = [7,7,7,7,12,7,7], m = 2, k = 3
+Output: 12
+Explanation: We need 2 bouquets each should have 3 flowers.
+Here is the garden after the 7 and 12 days:
+After day 7: [x, x, x, x, _, x, x]
+We can make one bouquet of the first three flowers that bloomed. We cannot make another bouquet from the last three flowers that bloomed because they are not adjacent.
+After day 12: [x, x, x, x, x, x, x]
+It is obvious that we can make two bouquets in different ways.
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/1401-1500/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/Solution.go

@@ -1,5 +1,48 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "sort"
+
+func Solution(bloomDay []int, m int, k int) int {
+	l := len(bloomDay)
+	need := m * k
+	if need > l {
+		return -1
+	}
+	var ok func(int) bool
+	ok = func(day int) bool {
+		c := 0
+		complete := 0
+		for i := 0; i < l; i++ {
+			if bloomDay[i] <= day {
+				c++
+				continue
+			}
+			complete += c / k
+			c = 0
+		}
+		complete += c / k
+		return complete >= m
+	}
+
+	dst := make([]int, 0)
+	in := make(map[int]struct{})
+	for _, n := range bloomDay {
+		if _, ok := in[n]; !ok {
+			dst = append(dst, n)
+			in[n] = struct{}{}
+		}
+	}
+	sort.Ints(dst)
+	left, right := 0, len(dst)
+	ans := -1
+	for left < right {
+		mid := (right + left) / 2
+		if ok(dst[mid]) {
+			ans = dst[mid]
+			right = mid
+			continue
+		}
+		left = mid + 1
+	}
+	return ans
 }

leetcode/1401-1500/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/Solution_test.go

@@ -10,30 +10,31 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		b      []int
+		m, k   int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []int{1, 10, 3, 10, 2}, 3, 1, 3},
+		{"TestCase2", []int{1, 10, 3, 10, 2}, 3, 2, -1},
+		{"TestCase3", []int{7, 7, 7, 7, 12, 7, 7}, 2, 3, 12},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.b, c.m, c.k)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v %v",
+					c.expect, got, c.b, c.m, c.k)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }