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/unique_num_occurrences.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/unique_num_occurrences.cpp')
-rw-r--r-- | other/unique_num_occurrences.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/unique_num_occurrences.cpp b/other/unique_num_occurrences.cpp deleted file mode 100644 index 5c4871f..0000000 --- a/other/unique_num_occurrences.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool uniqueOccurrences(vector<int> &arr) { - short m[2001] = {}; - for (auto n : arr) - ++m[n + 1000]; - sort(begin(m), end(m)); - for (auto i = 1; i < 2001; ++i) - if (m[i] && m[i] == m[i - 1]) - return false; - return true; - } -}; - -int main() { - Solution obj; - vector<int> arr = {1, 2, 2, 1, 1, 3}; - if (obj.uniqueOccurrences(arr)) - cout << "true"; - else - cout << "false"; -} |