387. First Unique Character in a String

Q:Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.

问题:给定一个字符串,找出其中第一个仅出现一次的字符,若不存在返回-1。

Examples:

s = "leetcode"
return 0.

s = "loveleetcode",
return 2.

代码:

    public int firstUniqChar(String s) {
        int freq [] = new int[26];
        for(int i = 0; i < s.length(); i ++)
            freq [s.charAt(i) - 'a'] ++;
        for(int i = 0; i < s.length(); i ++)
            if(freq [s.charAt(i) - 'a'] == 1)
                return i;
        return -1;
    }


你可能感兴趣的:(LeetCode,string,character,387.,First,Unique,Ch,LeetCode)