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 FirstUniqueCharacterInString {
    public int firstUniqChar(String s) {
        if (s.length() <= 1)
            return s.length() - 1;
        for (int i = 0; i < s.length(); i++) {
            if (s.indexOf(s.charAt(i)) == s.lastIndexOf(s.charAt(i)))
                return i;
        }
        return -1;
    }

    public static void main(String[] args) {
        FirstUniqueCharacterInString firstUniqueCharacterInString = new FirstUniqueCharacterInString();
        System.out.println(firstUniqueCharacterInString.firstUniqChar("loveleetcode"));
    }
}