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.
public class Solution {
public int firstUniqChar(String s) {
if(s==null||s.equals("")) return -1; //字符串为 null或者“”直接返回-1,好多程序都应该这样首先验证特殊情况
char[] cs = s.toCharArray();<span style="white-space:pre"> </span>//字符串转换为字符数组,关键!
boolean[] csb = new boolean[cs.length];//对应数组的标志,每次检测到后面又重复的将重复的标识置为true,循环遇到时跳过
if(cs.length == 1) return 0;
boolean isLast = false;
for(int i=0; i < cs.length-1; i++){
if(csb[i]==true) continue; <span style="white-space:pre"> </span>//已经被前面检测到重复,跳过本次循环,进行下一次。不这样好像有个很长的输入会超时
boolean isTwo = false;
for(int j=i+1; j< cs.length; j++){
// if(csb[j]==true) continue;
if( cs[i] == cs[j] ){
csb[j] = true;<span style="white-space:pre"> </span>
isTwo = true;<span style="white-space:pre"> </span>//每次i循环检查是否有相同的,有相同就置为true,否则后面检查到false就说明没有相同的,就return
if(j == cs.length-1) isLast = true; //因为每次j从i+1开始循环,也就是不检测前面的,最后一个不好检测,也用了一个flag
}
}
if(isTwo == false){
return i;
}
}
if(isLast == false) return cs.length-1;
return -1;
}
}