Leetcode 387. First Unique Character in a String (Easy) (cpp)

Leetcode 387. First Unique Character in a String (Easy) (cpp)

Difficulty: Easy

/*

387. First Unique Character in a String (Easy)

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.

*/
class Solution {
public:
	int firstUniqChar(string s) {
		int t[26] = { 0 };
		for (int i = 0;i < s.size();i++) {
			t[s[i] - 'a']++;
		}
		for (int i = 0;i < s.size();i++) {
			if (t[s[i] - 'a'] == 1) {
				return i;
			}
		}
		return -1;
	}
};