387. First Unique Character in a String

最新推荐文章于 2020-05-27 11:18:31 发布

五山小新新

最新推荐文章于 2020-05-27 11:18:31 发布

阅读量873

点赞数

分类专栏： Leetcode 题解

本文链接：https://blog.csdn.net/Al_xin/article/details/52280961

版权

Leetcode 题解专栏收录该内容

54 篇文章 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.

Subscribe to see which companies asked this question

解题思路：用map存储字符的个数，遍历两遍，确认第一个字符。

public class Solution {
    public int firstUniqChar(String s) {
        Map<Character, Integer> map2 = new HashMap<Character,Integer>();
        int len = s.length();
        for(int i = 0; i < len; i++)
        {
            if(map2.containsKey(s.charAt(i)))
            {
               int value = map2.get(s.charAt(i));
               value ++;
               map2.put(s.charAt(i),value);
            }else{
                 map2.put(s.charAt(i),1);
            }
        }

        for(int i = 0; i < len; i++)
        {
            if(map2.get(s.charAt(i))== 1)
            {
                return i;
            }
        }
        return -1;

    }
}