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.

 1 class Solution {
 2     public int firstUniqChar(String s) {
 3         int freq[] = new int[26];
 4         for (int i = 0; i < s.length(); i++) {
 5             freq[s.charAt(i) - 'a']++;
 6         }
 7             
 8         for (int i = 0; i < s.length(); i++) {
 9             if (freq[s.charAt(i) - 'a'] == 1) {
10                 return i;
11             }
12         }
13         return -1;
14     }
15 }

 

posted @ 2019-03-24 08:54  北叶青藤  阅读(135)  评论(0编辑  收藏  举报