GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — programming/problems/string/firstUniqueCharacter.cpp at master · rp-code9/programming Expand file tree/ Copy pathfirstUniqueCharacter.cppMore file actions 47 lines (36 loc) · 1.01 KB / Copy pathfirstUniqueCharacter.cppFile metadata and controls47 lines (36 loc) · 1.01 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 // https://www.techiedelight.com/find-first-non-repeating-character-string-one-traversal/ #include <iostream> #include <string> #include <unordered_map> int findFirstUniqueChar(std::string& str) { if (str.size() <= 1) { return str.size() - 1; } std::unordered_map<char, std::pair<int, int>> map; int n = str.size(); for (int i = 0; i < n; ++i) { map[str[i]].first++; map[str[i]].second = i; } int minIndex = str.size(); for (auto it : map) { int frequency = it.second.first; int index = it.second.second; if (frequency == 1 && index < minIndex) { minIndex = index; } } return minIndex; } int main() { std::string str = "ABCDBAGHCDG"; int index = findFirstUniqueChar(str); if (index < 0 || index == str.size()) { std::cout << "No unique charachter found\n"; } else { std::cout << "The first non-repeating character in the string is : " << str[index] << "\n"; } return 0; } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |