题目:请实现一个函数用来找出字符流中第一个只出现一次的字符。例如,当从字符流中只读出前两个字符“go”时,第一个只出现一次的字符是‘g’。当从该字符流中读出前六个字符“google”时,第一个只出现一次的字符是‘l’。
Java编程实现:
public class CharStatistics {
private int [] occurence = new int[256];
private int index = 0;
public CharStatistics()
{
for(int i = 0; i < 256; ++i)
occurence[i] = -1;
}
public void Insert(char ch)
{
if(occurence[ch] == -1)
occurence[ch] = index;
else if (occurence[ch] >= 0) {
occurence[ch] = -2;
}
index++;
}
public char FirstAppearingOnce()
{
char ch = '\0';
int minIndex = Integer.MAX_VALUE;
for (int i = 0; i < 256; ++i) {
if(occurence[i] >= 0 && occurence[i] < minIndex)
{
ch = (char)i;
minIndex = occurence[i];
}
}
return ch;
}
public static void main(String[] args) {
CharStatistics charStatistics = new CharStatistics();
String inputStr = "google";
char [] arr = inputStr.toCharArray();
for (int i = 0; i < arr.length; i++) {
charStatistics.Insert(arr[i]);
}
System.out.println("第一个只出现一次的字符是:" + charStatistics.FirstAppearingOnce());
}
}
运行结果:
总结:当我们需要找出到目前为止从字符流里读出的所有字符中第一个不重复的字符时,只需扫描整个数组,从中找出最小的大于等于0的值对应的字符。该功能对应于FirstAppearingOnce()函数。