参考思路
package Cattlefrom;
public class TheFirstNoRepeat {
public static void main(String[] args) {
String ss = "google";
//将字符串转换为字符数组
char[] s = ss.toCharArray();
counts(s);
}
public static void counts(char[] s){
int[] arr=new int[s.length];
//让每个数和所有的数进行比较找出重复的数加1
for (int i = 0; i < s.length; i++) {
int count=0;
for (int j = 0; j < s.length; j++) {
if(s[i]==s[j]) {
count++;
arr[i] = count;
}
}
}
//若存值就为1的话,说明它就出现一次,因为自身比较也需要加1
for(int k=0;k<arr.length;k++){
if(arr[k]==1){
System.out.println(k);
return;
}
}
}
}