diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_len_concat_str.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_len_concat_str.cpp')
-rw-r--r-- | other/max_len_concat_str.cpp | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/other/max_len_concat_str.cpp b/other/max_len_concat_str.cpp deleted file mode 100644 index b364d26..0000000 --- a/other/max_len_concat_str.cpp +++ /dev/null @@ -1,30 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int maxLength(vector<string> &arr) { - int ans = 0; - vector<bitset<26>> unique; - for (auto s : arr) { - bitset<26> b; - for (char ch : s) - b.set(ch - 'a'); - if (b.count() == s.size()) - unique.push_back(b); - } - vector<bitset<26>> concat = {bitset<26>()}; - for (auto &u : unique) - for (int i = concat.size() - 1; i >= 0; i--) - if ((concat[i] & u).none()) { - concat.push_back(concat[i] | u); - ans = max(ans, (concat[i].count() + u.count())); - } - return ans; - } -}; - -int main() { - Solution obj; - vector<string> arr = {"un", "iq", "ue"}; - cout << obj.maxLength(arr); -} |