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) {
for(int i=0;i<s.size();i++){
if(s.find(s[i])==s.rfind(s[i])) return i;
}
return -1;
}
};
Given a string, find the first non-repeating character in...
题目链接:https://leetcode-cn.com/problems/first-unique-charac...
Problem Statement Given a string, find the first non-repe...
题目 给定一个字符串, 字符串只包含小写字母. 找出字符串第一个不重复的字符索引, 找不到返回-1. 思路 先遍历...
First Unique Character in a StringLC 387Find the first un...
try not to be the first one,try to be the unique one
Description Find the first unique character in a given st...
链接 https://leetcode-cn.com/problems/first-unique-characte...
First Unique Number In Stream LC:387 A follow-up of 2018-...
https://leetcode-cn.com/problems/first-unique-character-i...
本文标题：LeetCode387. First Unique Charac
本文链接：https://www.haomeiwen.com/subject/bmsepttx.html
网友评论