LeetCode 387. First Unique Character in a String

最新推荐文章于 2023-09-08 14:58:28 发布

develbai

最新推荐文章于 2023-09-08 14:58:28 发布

阅读量246

点赞数

分类专栏： LeetCode 文章标签： LeetCode Algorithm

本文链接：https://blog.csdn.net/master5512/article/details/79417818

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

387. First Unique Character in a String

Description

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[] freq = new int[26];

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