剑指offer之字符流中第一个不重复的字符

题目描述

请实现一个函数用来找出字符流中第一个只出现一次的字符。例如，当从字符流中只读出前两个字符"go"时，第一个只出现一次的字符是"g"。当从该字符流中读出前六个字符“google"时，第一个只出现一次的字符是"l"。

输出描述

如果当前字符流没有存在出现一次的字符，返回#字符。

解题思路

哈希，字符的范围是0~256，在构造函数中进行初始化。

Code

class Solution
{
public:
    Solution():index(0) {
        for(int i = 0; i<256; i++) {
            occurrence[i] = -1;
        }
    }
  //Insert one char from stringstream
    void Insert(char ch)
    {
         if(occurrence[ch] == -1) {
             occurrence[ch] = index;
         } else if(occurrence[ch] >= 0) {
             occurrence[ch] = -2;
         }
        index++;
    }
  //return the first appearence once char in current stringstream
    char FirstAppearingOnce()
    {
        char ch = '\0';
        int minIndex = -2;
        for(int i = 0; i<256; i++) {
            if(occurrence[i] >= 0) {
                if(minIndex == -2 || occurrence[i] < occurrence[minIndex]) {
                    minIndex = i;
                    ch = (char) i;
                }
            }
        }
        if(minIndex == -2) ch = '#';
        return ch;
    }
private:
    int occurrence[256];
    int index;
};

• java

public class Solution {
    private int index = 0;
    private static final int maxn = 123;
    private int[] alpha = new int[maxn];
    //Insert one char from stringstream
    public void Insert(char ch)
    {
        if(alpha[ch] == 0) {
            alpha[ch] = ++index;
        } else {
            alpha[ch] = -1;
        }
    }
  //return the first appearence once char in current stringstream
    public char FirstAppearingOnce()
    {
        int minIndex = Integer.MAX_VALUE;
        char ch = '#';
        for(int i = 0; i<maxn; i++) {
            if(alpha[i] > 0) {
                if(minIndex > alpha[i]) {
                    minIndex = alpha[i];
                    ch = (char)i;
                }
            }
        }
        return ch;
    }
}