# ------------------------------------ # class ListNode: def __init__(self, val=None): self.val = val self.next = None def list(self): go = self yield go while go.next not in [None, self]: go = go.next yield go @property def len(self): l = 0 for p in self.list(): l += 1 return l # ------------------------------------ # class Stack: class Data: def __init__(self, val): self.val = val def __init__(self, val=None): self.___val__ = val and Stack.Data(val) self.___next__ = None self.___pre__ = None @property def val(self): return self.___val__ and self.___val__.val @property def top(self): while self.___next__ is not None: self = self.___next__ return self def push(self, val): top = self.top top.___next__ = Stack(val) top.___next__.___pre__ = top return top.___next__.val def pop(self): top = self.top val = top.val top.___val__ = None if top.___pre__ is not None: top.___pre__.___next__ = None return val # ------------------------------------ # class Queue: class Data: def __init__(self, val): self.val = val def __init__(self, val=None): self.___val__ = val and Queue.Data(val) self.___next__ = None self.___pre__ = None @property def val(self): return self.___val__ and self.___val__.val @property def last(self): while self.___next__ is not None: self = self.___next__ return self def enqueue(self, val): last = self.last last.___next__ = Queue(val) last.___next__.___pre__ = last return last.___next__.val def dequeue(self): val = self.val if self.___next__ is not None: self.___val__ = self.___next__.___val__ self.___next__ = self.___next__.___next__ if self.___next__ is not None: self.___next__.___pre__ = self else: self.___val__ = None return val # ------------------------------------ # class HashTable: def __init__(self, name, size=128, uselen=2, tell=True): self.___tableName__ = name self.___size__ = 128 if size<1 or type(size) is not int else size self.___uselen__ = 2 if uselen<1 or type(uselen) is not int else uselen self.___data__ = [ListNode(p) for p in range(self.size)] if tell: print("Built HashTable:", self.name) @property def name(self): return self.___tableName__ @property def size(self): return self.___size__ @property def uselen(self): return self.___uselen__ @property def data(self): return self.___data__ def get(self, ind): return self.data[ind%self.size] def getList(self, ind): head = self.get(ind) if head.next is None: return None else: return head.next.list() def itemIndex(self, item): sp = str(item) size = self.size uselen = self.uselen # decide the data index if len(sp)==0: return 0 else: ind = 0 for p in sp[:uselen]: ind += ord(p) return ind%size def insert(self, *item, tell=True): name = f"<{self.name}>" for p in item: # item type may not be string # so use its str to classify sp = str(p) ind = self.itemIndex(sp) d = self.___data__[ind] # put into data if d.next is None: d.next = ListNode(p) else: go = d while go.next is not None: sn = str(go.next.val) if sn" sp = str(item) ind = self.itemIndex(sp) d = self.___data__[ind] # nothing in the index if d.next is None: print("Removal failed: In " + name + " not found:", sp) return False else: go = d while go.next is not None: sn = str(go.next.val) if sn

[Contest] Hash Table