字符流中第一个只出现一次的字符

#ifndef TG_FIRST_APPEAR_ONCE_H
#define TG_FIRST_APPEAR_ONCE_H

#include <cstdio>
#include <vector>
#include <limits>
#include<array>

// 面试题50（二）：字符流中第一个只出现一次的字符
// 题目：请实现一个函数用来找出字符流中第一个只出现一次的字符。例如，当从
// 字符流中只读出前两个字符"go"时，第一个只出现一次的字符是'g'。当从该字
// 符流中读出前六个字符"google"时，第一个只出现一次的字符是'l'。
class tg_first_appear_once
{
public:
    tg_first_appear_once() : _index(0)
    {
        for(auto& i: _hash)
        {
            i=-1;
        }
    }

    void insert(char ch)
    {
        if(_hash[ch] == -1)
            _hash[ch] = _index;
        else if(_hash[ch] >= 0)
            _hash[ch] = -2;

        _index++;
    }

    char FirstAppearingOnce()
    {
        char ch = '\0';
        int minIndex = std::numeric_limits<int>::max();
        for(int i = 0; i < 256; ++i)
        {
            if(_hash[i] >= 0 && _hash[i] < minIndex)
            {
                ch = (char) i;
                minIndex = _hash[i];
            }
        }

        return ch;
    }

private:
    // occurrence[i]: A character with ASCII value i;
    // occurrence[i] = -1: The character has not found;
    // occurrence[i] = -2: The character has been found for mutlple times
    // occurrence[i] >= 0: The character has been found only once
    std::array<int, 256> _hash;
    int _index;
};

#endif // TG_FIRST_APPEAR_ONCE_H