一刷1090

Author: diguage

README.adoc

@@ -7655,14 +7655,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/1089-duplicate-zeros.adoc[题解]
 //|Easy
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/largest-values-from-labels/[1090. Largest Values From Labels^]
-//|{source_base_url}/_1090_LargestValuesFromLabels.java[Java]
-//|{doc_base_url}/1090-largest-values-from-labels.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/largest-values-from-labels/[1090. Largest Values From Labels^]
+|{source_base_url}/_1090_LargestValuesFromLabels.java[Java]
+|{doc_base_url}/1090-largest-values-from-labels.adoc[题解]
+|Medium
+|排序规则跟 179、870 题类似：保存下标，使用其他数组的值对下标数组进行排序。
+
 //|{counter:codes}
 //|{leetcode_base_url}/shortest-path-in-binary-matrix/[1091. Shortest Path in Binary Matrix^]
 //|{source_base_url}/_1091_ShortestPathInBinaryMatrix.java[Java]

docs/1090-largest-values-from-labels.adoc

@@ -8,8 +8,8 @@ We have a set of items: the `i`-th item has value `values[i]` and label `labels[
 Then, we choose a subset `S` of these items, such that:
 
 
-* `|S| <= num_wanted`
-* For every label `L`, the number of items in `S` with label `L` is `<= use_limit`.
+* `|S| \<= num_wanted`
+* For every label `L`, the number of items in `S` with label `L` is `\<= use_limit`.
 
 
 Return the largest possible sum of the subset `S`.
@@ -66,14 +66,34 @@ Return the largest possible sum of the subset `S`.
 * `1 <= num_wanted, use_limit <= values.length`
 
 
+== 思路分析
 
+初看以为是回溯（回溯也可以，能通过大部分的测试），看答案之后，可以通过排序来解决。
 
-
-
+再次想想，感觉回溯解决不了问题，它没办法保证首先选中的就是大数。
 
 [[src-1090]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_1090_LargestValuesFromLabels.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_1090_LargestValuesFromLabels_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
 
+. https://leetcode.cn/problems/largest-values-from-labels/solutions/2278874/shou-biao-qian-ying-xiang-de-zui-da-zhi-5h9ll/[1090. 受标签影响的最大值 - 官方题解^]

docs/index.adoc

@@ -2254,7 +2254,7 @@ include::1011-capacity-to-ship-packages-within-d-days.adoc[leveloffset=+1]
 
 // include::1089-duplicate-zeros.adoc[leveloffset=+1]
 
-// include::1090-largest-values-from-labels.adoc[leveloffset=+1]
+include::1090-largest-values-from-labels.adoc[leveloffset=+1]
 
 // include::1091-shortest-path-in-binary-matrix.adoc[leveloffset=+1]
 

logbook/202406.adoc

@@ -868,6 +868,13 @@
 |{doc_base_url}/2507-smallest-value-after-replacing-with-sum-of-prime-factors.adoc[题解]
 |❌ 数学计算，一脸懵逼
 
+
+|{counter:codes}
+|{leetcode_base_url}/largest-values-from-labels/[1090. Largest Values From Labels^]
+|{doc_base_url}/1090-largest-values-from-labels.adoc[题解]
+|⭕️ 贪心。排序规则跟 179、870 题类似：保存下标，使用其他数组的值对下标数组进行排序。
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

src/main/java/com/diguage/algo/leetcode/_1090_LargestValuesFromLabels.java

@@ -0,0 +1,37 @@
+package com.diguage.algo.leetcode;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1090_LargestValuesFromLabels {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-25 19:36:28
+   */
+  public int largestValsFromLabels(int[] values, int[] labels, int numWanted, int useLimit) {
+    int length = values.length;
+    Integer[] id = new Integer[length];
+    for (int i = 0; i < length; i++) {
+      id[i] = i;
+    }
+    // 倒序排列，把大数放在前面
+    Arrays.sort(id, (a, b) -> Integer.compare(values[b], values[a]));
+    Map<Integer, Integer> cnt = new HashMap<>();
+    int result = 0;
+    int choose = 0;
+    for (int i = 0; i < length && choose < numWanted; i++) {
+      int label = labels[id[i]];
+      if (cnt.getOrDefault(label, 0) == useLimit) {
+        continue;
+      }
+      result += values[id[i]];
+      choose++;
+      cnt.put(label, cnt.getOrDefault(label, 0) + 1);
+    }
+    return result;
+  }
+  // end::answer[]
+}