387. First Unique Character in a String

SHURamos

于 2016-09-21 20:14:06 发布

阅读量264

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/SHURamos/article/details/52612680

版权

Leetcode 专栏收录该内容

220 篇文章 0 订阅

订阅专栏

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) {
        int[] data=new int[26];
        for(int i=0;i<s.length();++i)
            data[s.charAt(i)-'a']++;
        for(int i=0;i<s.length();++i)
            if(data[s.charAt(i)-'a']==1)
                return i;
        return -1;
    }
}