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/first_unique_char_string.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/first_unique_char_string.cpp')
-rw-r--r-- | other/first_unique_char_string.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/first_unique_char_string.cpp b/other/first_unique_char_string.cpp deleted file mode 100644 index 5f55821..0000000 --- a/other/first_unique_char_string.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int firstUniqChar(string s) { - unordered_map<char, pair<int, int>> ump; - int idx = s.size(); - for (int i = 0; i < s.size(); i++) { - ump[s[i]].first++; - ump[s[i]].second = i; - } - for (const auto &[c, p] : ump) - if (p.first == 1) - idx = min(idx, p.second); - return idx == s.size() ? -1 : idx; - } -}; - -int main() { - Solution obj; - cout << obj.firstUniqueChar("loveleetcode"); -} |