首页 > 代码库 > Leetcode-387 First Unique Character in a String
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
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。