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.
对于统计字符出现次数,常见的套路是char[] cha=new char[26]
public class Solution {
public int firstUniqChar(String s) {
char[] cha=new char[26];
for(int i=0;i<s.length();i++)
{
cha[s.charAt(i)-'a']+=1;
}
for(int i=0;i<s.length();i++)
{
if(cha[s.charAt(i)-'a']==1) return i;
}
return -1;
}
}