From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/longest_subseq_lim_sum.cpp | 31 ------------------------------- 1 file changed, 31 deletions(-) delete mode 100644 other/longest_subseq_lim_sum.cpp (limited to 'other/longest_subseq_lim_sum.cpp') diff --git a/other/longest_subseq_lim_sum.cpp b/other/longest_subseq_lim_sum.cpp deleted file mode 100644 index 9613667..0000000 --- a/other/longest_subseq_lim_sum.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector answerQueries(vector &nums, vector &queries) { - int n = nums.size(), m = queries.size(); - sort(nums.begin(), nums.end()); - vector 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 nums = {4, 5, 2, 1}, queries = {3, 10, 21}; - for (auto i : obj.answerQueries(nums, queries)) - cout << i << ' '; -} -- cgit v1.2.3