剑指offer【[编程题]字符流中第一个不重复的字符】——Python实现

# -*- coding:utf-8 -*-
class Solution:
    # 返回对应char
    def __init__(self):
        self.c = ""
        self.d = {}
    def FirstAppearingOnce(self):
        for s in self.c:
            if self.c.count(s) == 1:
                return s
        return "#"
    def Insert(self, char):
        self.c = self.c + (char)

猜你喜欢

转载自blog.csdn.net/yg838457845/article/details/81130055