剑指offer-字符流中第一个不重复的字符

class Solution
{
public:
  //Insert one char from stringstream
    void Insert(char ch)
    {
        count[ch-‘\0‘]++;
        queue1.push(ch);
        
    }
  //return the first appearence once char in current stringstream
    char FirstAppearingOnce()
    {
        while(!queue1.empty()){
            char temp = queue1.front();
            if(count[temp-‘\0‘]==1){
                return temp;
            }
            else{
                queue1.pop();
            }
        }
        return ‘#‘;
    }
    int count[128];
    queue<char> queue1;

};