题目描述
请实现一个函数用来找出字符流中第一个只出现一次的字符。例如,当从字符流中只读出前两个字符"go"时,第一个只出现一次的字符是"g"。当从该字符流中读出前六个字符“google"时,第一个只出现一次的字符是"l"。
输出描述:
如果当前字符流没有存在出现一次的字符,返回#字符。
import java.util.*;
public class Solution {
Queue<Integer> queue = new LinkedList<>();
int[] appeared = new int[256];
//Insert one char from stringstream
public void Insert(char ch) {
if (appeared[ch] == 0) {
appeared[ch] = 1;
queue.add((int) ch);
} else {
appeared[ch] = 2;
int size = queue.size();
while (size-- != 0) {
int peek = queue.peek();
if (appeared[peek] != 1) {
queue.remove();
} else {
break;
}
}
}
}
//return the first appearence once char in current stringstream
public char FirstAppearingOnce() {
int size = queue.size();
if (size == 0) {
return '#';
} else {
return (char) (int) queue.peek();
}
}
}