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/non_decreasing_subseq.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/non_decreasing_subseq.cpp')
-rw-r--r-- | other/non_decreasing_subseq.cpp | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/other/non_decreasing_subseq.cpp b/other/non_decreasing_subseq.cpp new file mode 100644 index 0000000..b94510f --- /dev/null +++ b/other/non_decreasing_subseq.cpp @@ -0,0 +1,46 @@ +// 491. Non-decreasing Subsequences +#include "leetcode.h" + +/* + * given: integer array 'nums' + * return: all possible different non-decreasing subsequences + * of given array with at least two elements. return value + * can be in any order + */ + +class Solution { +public: + vector<vector<int>> findSubsequences(vector<int> &nums) { + set<vector<int>> seqs = {vector<int>(0)}; + for (int i = 0; i < nums.size(); i++) { + vector<vector<int>> built(seqs.size()); + copy(seqs.begin(), seqs.end(), built.begin()); + for (auto s : built) + if (s.empty() || nums[i] >= s.back()) { + s.push_back(nums[i]); + seqs.insert(s); + } + } + vector<vector<int>> ans; + for (auto s : seqs) + if (s.size() > 1) + ans.push_back(s); + return ans; + } +}; + +int main() { + Solution obj; + vector<int> n1 = {4, 6, 7, 7}, n2 = {4, 4, 3, 2, 1}; + for (auto i : obj.findSubsequences(n1)) { + for (auto j : i) + printf("%d ", j); + printf("\n"); + } + printf("\n"); + for (auto i : obj.findSubsequences(n2)) { + for (auto j : i) + printf("%d ", j); + printf("\n"); + } +} |