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/split_array_consec_subseq.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/split_array_consec_subseq.cpp')
-rw-r--r-- | other/split_array_consec_subseq.cpp | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/other/split_array_consec_subseq.cpp b/other/split_array_consec_subseq.cpp deleted file mode 100644 index 622e296..0000000 --- a/other/split_array_consec_subseq.cpp +++ /dev/null @@ -1,33 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool isPossible(vector<int> &nums) { - unordered_map<int, int> um; - for (auto &it : nums) - um[it]++; - for (auto &it : nums) { - if (um[it] == 0) - continue; - int freq = um[it], curr = it, count = 0; - while (um.count(curr) && um[curr] >= freq) { - freq = fmax(freq, um[curr]); - um[curr]--; - count++; - curr++; - } - if (count < 3) - return false; - } - return true; - } -}; - -int main() { - Solution obj; - vector<int> nums = {1, 2, 3, 4, 5}; - if (obj.isPossible(nums)) - cout << "true"; - else - cout << "false"; -} |