这题跟子序列的顺序是无关的,所以可以Arrays.sort
class Solution {
public int[] answerQueries(int[] nums, int[] queries) {
Arrays.sort(nums);
int m=nums.length;
int n=queries.length;
int[] ans=new int[n];
for( int i=0;i<n;i++){
int sum=0;
int count=0;
for(int j=0;j<m;j++){
if(sum+nums[j]<=queries[i])
{
sum+=nums[j];
count++;
}
ans[i]=count;
}
}
return ans;
}
}