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

题目描述

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

输出描述:

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

https://github.com/gatieme/CodingInterviews/tree/master/055-%E5%AD%97%E7%AC%A6%E6%B5%81%E4%B8%AD%E7%AC%AC%E4%B8%80%E4%B8%AA%E4%B8%8D%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%97%E7%AC%A6

class Solution

{

public:

    Solution()

    {
        str = "";
        memset(count, '\0', sizeof(count));
    }


    //  Insert one char from stringstream

    void Insert(char ch)

    {
        str += ch;
        count[(int)ch]++;

    }


    //  Return the first appearence once char in current stringstream

    char FirstAppearingOnce()

    {

        int len = str.size();

        for (int i = 0; i < len; i++)

        {
            if (count[(int)str[i]] == 1)
            {
                return str[i];
            }

        }

        return '#';
    }


private:

    std::string     str;
    int             count[256];

};


int main()

{

    Solution solu;

    solu.Insert('g');

    cout << solu.FirstAppearingOnce() << endl;

    solu.Insert('o');

    cout << solu.FirstAppearingOnce() << endl;


    solu.Insert('o');

    cout << solu.FirstAppearingOnce() << endl;


    solu.Insert('g');

    cout << solu.FirstAppearingOnce() << endl;

    solu.Insert('l');

    cout << solu.FirstAppearingOnce() << endl;

    solu.Insert('e');

    cout << solu.FirstAppearingOnce() << endl;

    return 0;

}