首页 > itarticle > leetcode 0387

leetcode 0387

admin 11月 13, 2020 0

Desicription

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.

Solution

class  {
public:
    int firstUniqChar(const std::string& s) {
        auto book = std::vector<int>(26, false);
        for(int i = 0; i < s.size(); i++) {
            book[s[i] - 'a']++;
            }

        for(int i = 0; i < s.size(); i++) {
            if(book[s[i] - 'a'] == 1) {
                return i;
            }
        }

        return -1;
    }
};