题目描述:请实现一个函数用来找出字符流中第一个只出现一次的字符。例如,当从字符流中只读出前两个字符"go"时,第一个只出现一次的字符是"g"。当从该字符流中读出前六个字符“google"时,第一个只出现一次的字符是"l"。
输出描述:如果当前字符流没有存在出现一次的字符,返回#字符。
思路一:
一个字符占8位,因此不会超过256个,可以申请一个256大小的数组来实现一个简易的哈希表。
public class Solution {
int[] hashtable = new int[256];
StringBuffer s = new StringBuffer();
//Insert one char from stringstream
public void Insert(char ch)
{
s.append(ch);
if (hashtable[ch] == 0)
hashtable[ch] = 1;
else
hashtable[ch] += 1;
}
//return the first appearence once char in current stringstream
public char FirstAppearingOnce()
{
char[] chars = s.toString().toCharArray();
for (char c : chars)
if (hashtable[c] == 1)
return c;
return '#';
}
}
思路二:
用ArrayList,看有没有,有去掉,没有添加,返回的时候返回第一个,为空就返回#。
import java.util.ArrayList;
public class Solution {
ArrayList<Character> list = new ArrayList<>();
//Insert one char from stringstream
public void Insert(char ch)
{
if (!list.contains(ch))
list.add(ch);
else
list.remove(new Character(ch));
}
//return the first appearence once char in current stringstream
public char FirstAppearingOnce()
{
if (list.isEmpty())
return '#';
return list.get(0);
}
}
思路三:
public class Solution {
private int[] arr = new int[256];
private int index = 1;
//Insert one char from stringstream
public void Insert(char ch)
{
if (arr[ch] == 0)
arr[ch] = index;
else if (arr[ch] >= 1)
arr[ch] = -1;
index++;
}
//return the first appearence once char in current stringstream
public char FirstAppearingOnce()
{
char c = '#';
int minIndex = Integer.MAX_VALUE;
for (int i = 0; i < 256; i++)
{
if (arr[i] >= 1 && arr[i] < minIndex) {
c = (char) i;
minIndex = arr[i];
}
}
return c;
}
}