老师，我感觉是照着你的代码写的，但是发现运行结果不对，我觉得是find_key方法写的有问题。
class Array():
def __init__(self,size=4):
self.__size = size # 记录容器大小
self.__item = [None]*size #分配空间
self.__length = 0
def __setitem__(self,key,value):
self.__item[key] = value
self.__length += 1
def __getitem__(self,key):
return self.__item[key]
def __len__(self):
return self.__length
def __iter__(self):
for value in self.__item:
yield value
class Slot():
def __init__(self,key=None,value=None):
self.key = key
self.value = value
def __str__(self):
return 'key:{},value:{}'.format(self.key,self.value)
class HashTable():
def __init__(self,size=4):
self.size = size
self.item = Array(self.size)
def get_index(self,key):
return hash(key) % self.size
def find_index_to_insert(self,key):
index = self.get_index(key) # 获取key对应的索引
if self.item[index] == None: # 索引没被占用
return index
else:
while self.item[index] is not None:
if key == self.item[index].key: # 获取到相同的key
return index
else:
index = (index*5+1) % self.size
return index
def push(self,key,value): # 存放数据
index = self.find_index_to_insert(key) # 获取key对应的索引
self.item[index] = Slot(key,value)
def find_key(self,key):
index = self.get_index(key) # 获取key对应的索引
if self.item[index] == None:
return None
else:
while self.item is not None:
if key == self.item[index].key: # 判断查找的Key是否与item里的key相同
return index
else:
index = (index*5+1) % self.size
return None
def get(self,key): # 获取数据
index = self.find_key(key) # 获取key对应的索引
if index:
return self.item[index]
return None
if __name__ == "__main__":
h = HashTable()
h.push('name','吕布')
h.push('sex1','男')
h.push('sex2','女')
h.push('sex3','保密')
print(h.get('name'))
print(h.get('sex3'))
print(h.get('sex2'))
print(h.get('sex1'))
# print(h.get('age'))
运行结果：
提问中的-14的二进制不是11110010吗，为什么要在前面加上3条11111111？
京公网安备 11011402011233号