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/first_unique_char_string.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/first_unique_char_string.cpp')
-rw-r--r-- | other/first_unique_char_string.cpp | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/other/first_unique_char_string.cpp b/other/first_unique_char_string.cpp new file mode 100644 index 0000000..5f55821 --- /dev/null +++ b/other/first_unique_char_string.cpp @@ -0,0 +1,22 @@ +#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"); +} |