diff options
Diffstat (limited to 'longest_subseq_lim_sum.cpp')
-rw-r--r-- | longest_subseq_lim_sum.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/longest_subseq_lim_sum.cpp b/longest_subseq_lim_sum.cpp deleted file mode 100644 index 9613667..0000000 --- a/longest_subseq_lim_sum.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<int> answerQueries(vector<int> &nums, vector<int> &queries) { - int n = nums.size(), m = queries.size(); - sort(nums.begin(), nums.end()); - vector<int> ans, pre(n + 1, 0); - for (int i = 1; i < n; i++) - pre[i] = pre[i - 1] + nums[i - 1]; - for (int i = 0; i < m; i++) { - int sum = queries[i]; - auto z = lower_bound(pre.begin(), pre.end(), sum) - pre.begin(); - if (z < n + 1) { - if (pre[z] == sum) - ans.push_back(z); - else - ans.push_back(z - 1); - } else if (z == n + 1) - ans.push_back(n); - } - return ans; - } -}; - -int main() { - Solution obj; - vector<int> nums = {4, 5, 2, 1}, queries = {3, 10, 21}; - for (auto i : obj.answerQueries(nums, queries)) - cout << i << ' '; -} |