给定一个字符串, 字符串只包含小写字母. 找出字符串第一个不重复的字符索引, 找不到返回-1.
Input: "leetcode"
Output: 0
Input: "loveleetcode"
Output: 2
先遍历一次,找出每个字符的出现次数. 遍历第二次输出结果.
int firstUniqChar(string s) {
vector<int> vec(26,0);
for (char a : s) {
vec[a-'a']++;
}
for (int i = 0;i < s.size();i++) {
if (vec[s[i]-'a'] == 1) {
return i;
}
}
return -1;
}
加入不是只包含小写字母, 就需要使用map. 本题使用数组明显速度和内存都更优.
题目 给定一个字符串, 字符串只包含小写字母. 找出字符串第一个不重复的字符索引, 找不到返回-1. 思路 先遍历...
题目链接:https://leetcode-cn.com/problems/first-unique-charac...
Problem Statement Given a string, find the first non-repe...
Given a string, find the first non-repeating character in...
题目: Given a string you need to print the size of the long...
This is a picture that is extremely beautiful, the charac...
According to the changes in the charac-teristics of the p...
Spatio-temporal variations and potential diffusion charac...
官方的文档 A string parser that scans for substrings or charac...
报错： UnicodeEncodeError: 'ascii' codec can't encode charac...
本文标题：Leetcode.387.FIrst Unique Charac
本文链接：https://www.haomeiwen.com/subject/nrihactx.html
网友评论