387. First Unique Character in a String

最新推荐文章于 2019-12-13 23:16:27 发布

寒沧

最新推荐文章于 2019-12-13 23:16:27 发布

阅读量147

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u011669700/article/details/79440778

版权

leetcode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

原题链接： https://leetcode.com/problems/first-unique-character-in-a-string/description/

首选计算每一个字母的出现频率
然后找到第一个出现频次为1的字母索引

/**
 * Created by Joe on 2018/3/4.
 * 387. First Unique Character in a String
 * https://leetcode.com/problems/first-unique-character-in-a-string/description/
 */
public class P387 {
    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;
    }
}