Package g2301_2400.s2389_longest_subsequence_with_limited_sum

Class Solution

java.lang.Object

g2301_2400.s2389_longest_subsequence_with_limited_sum.Solution

public class Solution
extends Object

2389 - Longest Subsequence With Limited Sum.<p>Easy</p> <p>You are given an integer array <code>nums</code> of length <code>n</code>, and an integer array <code>queries</code> of length <code>m</code>.</p> <p>Return <em>an array</em> <code>answer</code> <em>of length</em> <code>m</code> <em>where</em> <code>answer[i]</code> <em>is the <strong>maximum</strong> size of a <strong>subsequence</strong> that you can take from</em> <code>nums</code> <em>such that the <strong>sum</strong> of its elements is less than or equal to</em> <code>queries[i]</code>.</p> <p>A <strong>subsequence</strong> is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [4,5,2,1], queries = [3,10,21]</p> <p><strong>Output:</strong> [2,3,4]</p> <p><strong>Explanation:</strong> We answer the queries as follows:</p> <ul> <li> <p>The subsequence [2,1] has a sum less than or equal to 3. It can be proven that 2 is the maximum size of such a subsequence, so answer[0] = 2.</p> </li> <li> <p>The subsequence [4,5,1] has a sum less than or equal to 10. It can be proven that 3 is the maximum size of such a subsequence, so answer[1] = 3.</p> </li> <li> <p>The subsequence [4,5,2,1] has a sum less than or equal to 21. It can be proven that 4 is the maximum size of such a subsequence, so answer[2] = 4.</p> </li> </ul> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,3,4,5], queries = [1]</p> <p><strong>Output:</strong> [0]</p> <p><strong>Explanation:</strong> The empty subsequence is the only subsequence that has a sum less than or equal to 1, so answer[0] = 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n == nums.length</code></li> <li><code>m == queries.length</code></li> <li><code>1 <= n, m <= 1000</code></li> <li><code>1 <= nums[i], queries[i] <= 10⁶</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	answerQueries(int[] nums, int[] queries)

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

answerQueries

public int[] answerQueries(int[] nums,
 int[] queries)