Leetcode-387 First Unique Character in a String
Posted 北冥有鱼,南冥有猫
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode-387 First Unique Character in a String相关的知识,希望对你有一定的参考价值。
#387. 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.
题解:词频统计。
class Solution { public: int firstUniqChar(string s) { vector<int> nums(26); for(int i=0;i<s.size();i++) { nums[s[i]-‘a‘]++; } for(int i=0;i<s.size();i++) { if(nums[s[i]-‘a‘]==1) { return i; } } return -1; } };
以上是关于Leetcode-387 First Unique Character in a String的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode387. First Unique Character in a String
Leetcode-387 First Unique Character in a String
LeetCode - 387. First Unique Character in a String
[leetcode-387-First Unique Character in a String]