字符流中第一个不重复的字符

请实现一个函数用来找出字符流中第一个只出现一次的字符。例如，当从字符流中只读出前两个字符"go"时，第一个只出现一次的字符是"g"。当从该字符流中读出前六个字符“google"时，第一个只出现一次的字符是"l"。 

输出描述:

如果当前字符流没有存在出现一次的字符，返回#字符。

class Solution
{
public:
    Solution():index(0)
    {
        for(int i = 0 ; i < 256; i++)
            occurrence[i] = -1;
    }
    //Insert one char from stringstream
    void Insert(char ch)
    {
        if(occurrence[ch] == -1)
            occurrence[ch] = index;
        else
            occurrence[ch] = -2;
        index++;
    }
    //return the first appearence once char in current stringstream
    char FirstAppearingOnce()
    {
        char ch = '#';
        int minindex = numeric_limits<int>::max();
        for(int i = 0; i <256;i++)
        {
            if(occurrence[i]>=0 &&occurrence[i] < minindex)
            {
                ch = (char)i;
                minindex = occurrence[i];
            }
        }
        return ch;
    }
private:
    int occurrence[256];
    int index;
};