LeetCode复习 计数系列

#387 字符串中的第一个唯一字符

 public char firstUniqChar(String s) {
        char[] chars = s.toCharArray();
        int[] map = new int[26];
        for (int i = 0; i < chars.length; i++) {
            map[chars[i] - 'a'] += 1;
        }
        for (int i = 0; i < s.length(); i++) {
            if (map[chars[i] - 'a'] == 1) {
                return chars[i];
            }
        }
        return ' ';
    }

#剑指 Offer 50 第一个只出现一次的字符

 public int firstUniqChar1(String s) {
        Map<Character, Integer> map = new LinkedHashMap<>();
        char[] chars = s.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            map.put(chars[i],map.getOrDefault(chars[i],0) + 1);
        }
        for (int i = 0; i < s.length(); ++i) {
            if (map.get(s.charAt(i)) == 1) {
                return i;
            }
        }
        return -1;
    }