@@ -23,49 +23,49 @@ def _random_level(self):
2323
2424 def insert (self , value ):
2525 update = [None ] * (self .MAX_LEVEL + 1 )
26- x = self .head
26+ current = self .head
2727
2828 # Find the place where the new value should go
29- for i in range (self .level , - 1 , - 1 ):
30- while x .next [i ] and x .next [i ].value < value :
31- x = x .next [i ]
32- update [i ] = x
29+ for level in range (self .level , - 1 , - 1 ):
30+ while current .next [level ] and current .next [level ].value < value :
31+ current = current .next [level ]
32+ update [level ] = current
3333
34- x0 = x .next [0 ]
35- if x0 and x0 .value == value :
34+ next_node = current .next [0 ]
35+ if next_node and next_node .value == value :
3636 return
3737
3838 node_level = self ._random_level ()
3939
4040 if node_level > self .level :
41- for i in range (self .level + 1 , node_level + 1 ):
42- update [i ] = self .head
41+ for level in range (self .level + 1 , node_level + 1 ):
42+ update [level ] = self .head
4343 self .level = node_level
4444
4545 new_node = Node (value , node_level )
46- for i in range (node_level + 1 ):
47- new_node .next [i ] = update [i ].next [i ]
48- update [i ].next [i ] = new_node
46+ for level in range (node_level + 1 ):
47+ new_node .next [level ] = update [level ].next [level ]
48+ update [level ].next [level ] = new_node
4949
5050 # Check if value exists
5151 def contains (self , value ):
52- x = self .head
53- for lvl in range (self .level , - 1 , - 1 ):
54- while x .next [lvl ] and x .next [lvl ].value < value :
55- x = x .next [lvl ]
52+ current = self .head
53+ for level in range (self .level , - 1 , - 1 ):
54+ while current .next [level ] and current .next [level ].value < value :
55+ current = current .next [level ]
5656
57- x = x .next [0 ]
58- return x is not None and x .value == value
57+ candidate = current .next [0 ]
58+ return candidate is not None and candidate .value == value
5959
6060 def __contains__ (self , value ):
6161 return self .contains (value )
6262
6363 def to_list (self ):
6464 result = []
65- x = self .head .next [0 ]
66- while x :
67- result .append (x .value )
68- x = x .next [0 ]
65+ current = self .head .next [0 ]
66+ while current :
67+ result .append (current .value )
68+ current = current .next [0 ]
6969 return result
7070
7171
0 commit comments