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 = “l(fā)eetcode” return 0.
s = “l(fā)oveleetcode”, return 2. Note: You may assume the string contain only lowercase letters.
class Solution {public: int firstUniqChar(string s) { int alph[26] = {0}; for(int i = 0; i < s.length(); i++){ if(alph[s[i] - 'a'] == 0){ alph[s[i] - 'a'] = 1; int j = i + 1; for(; j < s.length(); j++){ if(s[i] == s[j]) break; } if(j == s.length()) return i; } } return -1; }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
