Merge pull request #1407 from 0xff-dev/3074

Add solution and test-cases for problem 3074

Author: 6boris

leetcode/3001-3100/3074.Apple-Redistribution-into-Boxes/README.md

@@ -1,28 +1,30 @@
 # [3074.Apple Redistribution into Boxes][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You are given an array `apple` of size `n` and an array `capacity` of size `m`.
+
+There are `n` packs where the `ith` pack contains `apple[i]` apples. There are m boxes as well, and the `ith` box has a capacity of `capacity[i]` apples.
+
+Return the **minimum** number of boxes you need to select to redistribute these `n` packs of apples into boxes.
+
+**Note** that, apples from the same pack can be distributed into different boxes.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: apple = [1,3,2], capacity = [4,3,1,5,2]
+Output: 2
+Explanation: We will use boxes with capacities 4 and 5.
+It is possible to distribute the apples as the total capacity is greater than or equal to the total number of apples.
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Apple Redistribution into Boxes
-```go
 ```
-
+Input: apple = [5,5,5], capacity = [2,4,2,7]
+Output: 4
+Explanation: We will need to use all the boxes.
+```
 
 ## 结语
 

leetcode/3001-3100/3074.Apple-Redistribution-into-Boxes/Solution.go

@@ -1,5 +1,17 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "sort"
+
+func Solution(apple []int, capacity []int) int {
+	sum := 0
+	for _, n := range apple {
+		sum += n
+	}
+	var ret int
+	sort.Ints(capacity)
+	for i := len(capacity) - 1; i >= 0 && sum > 0; i-- {
+		sum -= capacity[i]
+		ret++
+	}
+	return ret
 }

leetcode/3001-3100/3074.Apple-Redistribution-into-Boxes/Solution_test.go

@@ -9,31 +9,30 @@ import (
 func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
+		name            string
+		apple, capacity []int
+		expect          int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []int{1, 3, 2}, []int{4, 3, 1, 5, 2}, 2},
+		{"TestCase2", []int{5, 5, 5}, []int{2, 4, 2, 7}, 4},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.apple, c.capacity)
 			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",
+					c.expect, got, c.apple, c.capacity)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }