牛客--字符流中第一个不重复的字符

import java.util.HashMap;
public class Solution {
    StringBuffer sb=new StringBuffer();
    //Insert one char from stringstream
    public void Insert(char ch)
    {
        sb.append(ch);
    }
  //return the first appearence once char in current stringstream
    public char FirstAppearingOnce()
    {
        HashMap<Character,Integer> hash=new HashMap<Character,Integer>();
       for(int i=0;i<sb.length();i++){
           if(hash.containsKey(sb.charAt(i))){
               hash.put(sb.charAt(i),hash.get(sb.charAt(i))+1);
           }else{
               hash.put(sb.charAt(i),1);
           }
       } 
        for(int i=0;i<sb.length();i++){
            if(hash.get(sb.charAt(i))==1){
                return sb.charAt(i);
            }
        }
    
        return '#';
    }
}