Merge pull request #781 from 0xff-dev/1090

Add solution and test-cases for problem 1090

Author: 6boris

leetcode/1001-1100/1090.Largest-Values-From-Labels/README.md

@@ -1,28 +1,40 @@
 # [1090.Largest Values From Labels][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
+There is a set of `n` items. You are given two integer arrays `values` and `values` where the value and the label of the i<sup>th</sup> element are `values[i]` and `labels[i]` respectively. You are also given two integers `numWanted` and `useLimit`.
+
+Choose a subset `s` of the `n` elements such that:
+
+- The size of the subset `s` is **less than or equal to** `numWanted`.
+- There are **at most** `useLimit` items with the same label in `s`.
+
+The **score** of a subset is the sum of the values in the subset.
+
+Return the maximum **score** of a subset `s`.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: values = [5,4,3,2,1], labels = [1,1,2,2,3], numWanted = 3, useLimit = 1
+Output: 9
+Explanation: The subset chosen is the first, third, and fifth items.
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Largest Values From Labels
-```go
 ```
+Input: values = [5,4,3,2,1], labels = [1,3,3,3,2], numWanted = 3, useLimit = 2
+Output: 12
+Explanation: The subset chosen is the first, second, and third items.
+```
+
+**Example 3:**
 
+```
+Input: values = [9,8,8,7,6], labels = [0,0,0,1,1], numWanted = 3, useLimit = 1
+Output: 16
+Explanation: The subset chosen is the first and fourth items.
+```
 
 ## 结语
 

leetcode/1001-1100/1090.Largest-Values-From-Labels/Solution.go

@@ -1,5 +1,50 @@
 package Solution
 
-func Solution(x bool) bool {
+import (
+	"container/heap"
+)
+
+type heap1090 struct {
+	values []int
+	data   []int
+}
+
+func (h *heap1090) Len() int {
+	return len(h.data)
+}
+
+func (h *heap1090) Less(i, j int) bool {
+	return h.values[h.data[i]] > h.values[h.data[j]]
+}
+func (h *heap1090) Swap(i, j int) {
+	h.data[i], h.data[j] = h.data[j], h.data[i]
+}
+func (h *heap1090) Push(x interface{}) {
+	h.data = append(h.data, x.(int))
+}
+func (h *heap1090) Pop() interface{} {
+	old := h.data
+	l := len(old)
+	x := old[l-1]
+	h.data = old[:l-1]
 	return x
 }
+
+func Solution(values []int, labels []int, numWanted int, useLimit int) int {
+	group := make(map[int]int)
+	h := heap1090{data: make([]int, 0), values: values}
+	for i := 0; i < len(values); i++ {
+		heap.Push(&h, i)
+	}
+	ans := 0
+	for h.Len() > 0 && numWanted > 0 {
+		top := heap.Pop(&h).(int)
+		if group[labels[top]] >= useLimit {
+			continue
+		}
+		ans += values[top]
+		group[labels[top]]++
+		numWanted--
+	}
+	return ans
+}

leetcode/1001-1100/1090.Largest-Values-From-Labels/Solution_test.go

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