关闭

LeetCode387. First Unique Character in a String

标签: C++Leetcodestringcharacter
176人阅读 评论(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.

class Solution {
public:
    int firstUniqChar(string s) {
        int num[26] = {0};
        int pos[26] = {0};
        for (int i = 0; i < s.size(); i++) {
            char c = s[i];
            num[c-'a']++;
            pos[c-'a'] = i;
        }
        int i = 0;
        int idx = s.size();
        while (i < 26)
        {
            if (num[i] == 1) {
                if (pos[i] < idx) idx = pos[i];
            }
            i++;
        }
        if (idx == s.size())
            idx = -1;
        return idx;
    }
};



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人简介
    个人资料
    • 访问:732409次
    • 积分:7833
    • 等级:
    • 排名:第2755名
    • 原创:274篇
    • 转载:6篇
    • 译文:1篇
    • 评论:191条
    我的小站
    最新评论
    --
    我要啦免费统计