Implement a hash table in python

This article introduces a hash table implemented in python. the conflict processing method is the open address method, the conflict expression is Hi (H (key) + 1) modm, and m indicates the table length. More difficult zipper implementation later The code is as follows:

#! /Usr/bin/env python
# Coding = UTF-8
# Implement a hash table (linear address and then hash)

Def ChangeKey (key, m, di ):
Key01 = (key + di) % m
Return key01

A = raw_input ("Please entry the numbers: \ n"). split ()
M = len ()
Dict01 = {}
For I in:
Key = int (I) % m
If "% s" % key in dict01:
NewKey = ChangeKey (key, m, 1)
While "% s" % NewKey in dict01: # because the following dict01 key value is saved as a string, the string format is also used for judgment.
NewKey = ChangeKey (NewKey, m, 1)
Dict01 ["% s" % NewKey] = int (I)
Else:
Dict01 ["% s" % key] = int (I)
Print dict01