如果当前字符流没有存在出现一次的字符,返回#字符。
public class Solution {
private int[] occurrence=new int[256];//哈希表
private int count=0;//字符在字符流中的位置
public Solution(){
//最开始,哈希表中所有元素都初始化为-1
for(int i=0;i<256;i++){
occurrence[i]=-1;
}
}
//Insert one char from stringstream
public void Insert(char ch)
{
if(occurrence[ch]==-1){//如果第一次从字符流中读出字符ch
occurrence[ch]=count;
}
else{//如果再次从字符流中读出字符ch
occurrence[ch]=-2;
}
count++;
}
//return the first appearence once char in current stringstream
public char FirstAppearingOnce()
{
//遍历哈希表,找出最小的大于等于0的元素,返回其下标对应字符
int minIndex=256;
char ch='#';
for(int i=0;i<256;i++){
if(occurrence[i]>=0 && occurrence[i]<minIndex){
minIndex=occurrence[i];
ch=(char) (i);
}
}
return ch;
}
}