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

题目描述

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

#include <iostream>
#include <limits>

using namespace std;

//找出输入流中的第一个只出现一次的字符
class CharStatistics
{
public:
	CharStatistics(): index(0)
	{
		for (int i = 0; i < 256; i++)
			occurence[i] = -1;
	}

	void Insert(char ch)
	{
		if(occurence[ch] == -1)
		{
			occurence[ch] = index;
		}
		else if(occurence[ch] >= 0)
		{
			occurence[ch] = -2;
		}
		index++;
	}
	char FirstAppearOnce()
	{
		int minIndex = numeric_limits<int>::max();
		char ch = '\0';

		for (int i = 0;i < 256;i++)
		{
			if(occurence[i] >= 0 && minIndex > occurence[i])
			{
				ch = (char)i;
				minIndex = occurence[i];
			}
		}

		return ch;
	}
private:
	int index;
	int occurence[256];
};

// ==================== Test Code ====================
void Test(char* testName, CharStatistics chars, char expected)
{
    if(testName != NULL)
        printf("%s begins: ", testName);

    if(chars.FirstAppearOnce() == expected)
        printf("Passed.\n");
    else
        printf("FAILED.\n");
}

int main(int argc, char* argv[])
{
    CharStatistics chars;

    Test("Test1", chars, '\0');

    chars.Insert('g');
    Test("Test2", chars, 'g');

    chars.Insert('o');
    Test("Test3", chars, 'g');

    chars.Insert('o');
    Test("Test4", chars, 'g');

    chars.Insert('g');
    Test("Test5", chars, '\0');

    chars.Insert('l');
    Test("Test6", chars, 'l');

    chars.Insert('e');
    Test("Test7", chars, 'l');

	return 0;
}