和有限的最长子序列

/*
 * Solution approach using Java Streams:
 * 1. Sort the nums array using Arrays.sort.
 * 2. Iterate over each query in queries using streams.
 * 3. For each query, use a forEach loop within a stream to accumulate the sum of elements until the sum exceeds the query value.
 * 4. Track the number of elements added to the sum and collect the results in the answer array.
 */

import java.util.Arrays;
import java.util.stream.IntStream;

public class Solution {
    public int[] answerQueries(int[] nums, int[] queries) {
        Arrays.sort(nums); // Sort the nums array
        return IntStream.of(queries).map(query -> {
            int sum = 0;
            int count = 0;
            for (int num : nums) {
                if (sum + num <= query) {
                    sum += num;
                    count++;
                } else {
                    break;
                }
            }
            return count;
        }).toArray();
    }
}