[LeetCode] First Unique Character in a String
Posted immjc
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] First Unique Character in a String相关的知识,希望对你有一定的参考价值。
Given a string, find the first non-repeating character in it and return it‘s index. If it doesn‘t exist, return -1.
Examples:
s = "leetcode" return 0. s = "loveleetcode", return 2.
Note: You may assume the string contain only lowercase letters.
使用map统计字符串s中字母出现的次数后,然后遍历字符串,找到在map中值为1的字母,返回它的索引即可。
class Solution { public: int firstUniqChar(string s) { unordered_map<char, int> m; for (char c : s) m[c]++; for (int i = 0; i != s.size(); i++) if (m[s[i]] == 1) return i; return -1; } }; // 69 ms
以上是关于[LeetCode] First Unique Character in a String的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode(387)First Unique Character in a String
Leetcode: First Unique Character in a String
[LeetCode] First Unique Character in a String
LeetCode - 387. First Unique Character in a String