387. First Unique Character in a String [LeetCode]

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.

由题意，要求给定的字符串中第一个无重复的字符的下标。

思路简析：由于题目中给了个note：所给字符串中只有小写字母。可以考虑，先用一个有26个元素整型数组存储每个字母在串中的出现次数；再从左到右遍历串，如果读到的字符在数组中值为1，即只出现了这一次，无重复，返回此时字符的下标。如果读到结束还没有返回，则会返回代表没有找到的-1。

具体的java代码如下：

public class Solution {
    public int firstUniqChar(String s) {
        int c[] = new int[26];
        int len = s.length();
        for (int i=0; i