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

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

难度简单

在字符串 s 中找出第一个只出现一次的字符。如果没有，返回一个单空格。 s 只包含小写字母。

示例:

s = "abaccdeff"

返回 "b"

s = ""

返回 " "

限制：

0 <= s 的长度 <= 50000

class Solution {

    public char firstUniqChar(String s) {

            char ret=' ';

            int[] sum=new int[26];

            for (int i = 0; i <s.length(); i++){

                sum[s.charAt(i)-'a'] ++;

            }

            for (int i = 0; i <s.length(); i++){

                if (sum[s.charAt(i)-'a'] ==1){

                    return s.charAt(i);

                }

            }

            return ret;

    }

}

队列

class Solution {

    public char firstUniqChar(String s) {

        Map<Character, Integer> position = new HashMap<Character, Integer>();

        Queue<Pair> queue = new LinkedList<Pair>();

        int n = s.length();

        for (int i = 0; i < n; ++i) {

            char ch = s.charAt(i);

            if (!position.containsKey(ch)) {

                position.put(ch, i);

                queue.offer(new Pair(ch, i));

            } else {

                position.put(ch, -1);

                while (!queue.isEmpty() && position.get(queue.peek().ch) == -1) {

                    queue.poll();

                }

            }

        }

        return queue.isEmpty() ? ' ' : queue.poll().ch;

    }

    class Pair {

        char ch;

        int pos;

        Pair(char ch, int pos) {

            this.ch = ch;

            this.pos = pos;

        }

    }

}