diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/longest_subseq_lim_sum.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/longest_subseq_lim_sum.cpp')
-rw-r--r-- | other/longest_subseq_lim_sum.cpp | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/other/longest_subseq_lim_sum.cpp b/other/longest_subseq_lim_sum.cpp new file mode 100644 index 0000000..9613667 --- /dev/null +++ b/other/longest_subseq_lim_sum.cpp @@ -0,0 +1,31 @@ +#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 << ' '; +} |