Package g1001_1100.s1090_largest_values_from_labels

Class Solution

java.lang.Object

g1001_1100.s1090_largest_values_from_labels.Solution

public class Solution
extends Object

1090 - Largest Values From Labels\. Medium There is a set of `n` items. You are given two integer arrays `values` and `labels` where the value and the label of the ith 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:** 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:** **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. **Constraints:** * `n == values.length == labels.length` * 1 <= n <= 2 * 104 * 0 <= values[i], labels[i] <= 2 * 104 * `1 <= numWanted, useLimit <= n`

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	largestValsFromLabels(int[] values, int[] labels, int numWanted, int useLimit)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

largestValsFromLabels

public int largestValsFromLabels(int[] values,
 int[] labels,
 int numWanted,
 int useLimit)