leetcode 387. First Unique Character in a String

最新推荐文章于 2026-06-18 22:31:57 发布

转载最新推荐文章于 2026-06-18 22:31:57 发布 · 117 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/bonelee/p/8679027.html

标签

#java

收录于

本文介绍了一种高效算法，用于在给定字符串中查找第一个不重复的字符，并返回其索引位置。通过使用Python的collections.Counter和Java的LinkedHashMap，实现了一次扫描即可完成任务。适用于仅包含小写字母的字符串。

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(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        cnt = collections.Counter(s)
        for i,c in enumerate(s):
            if cnt[c] == 1:
                return i
        return -1

java 里还可以，直接一次扫描s搞定：

class Solution {
    public int firstUniqChar(String s) {
        Map<Character, Integer> map = new LinkedHashMap<>();
        Set<Character> set = new HashSet<>();
        for (int i = 0; i < s.length(); i++) {
            if (set.contains(s.charAt(i))) {
                if (map.get(s.charAt(i)) != null) {
                    map.remove(s.charAt(i));
                }
            } else {
                map.put(s.charAt(i), i);
                set.add(s.charAt(i));
            }
        }
        return map.size() == 0 ? -1 : map.entrySet().iterator().next().getValue();
    }
}