-
Notifications
You must be signed in to change notification settings - Fork 0
/
my_answer.py
248 lines (199 loc) · 6.42 KB
/
my_answer.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
import time
from functools import wraps
# 1
odd_sum = sum([i for i in range(100) if i % 2 == 1])
# 2
duple_list = list()
result = list(set(duple_list))
# 3
def reverse_string(s):
return s[::-1]
# 4
def timeout(max_time):
def decorated(func):
@wraps(func)
def wrapper(*args, **kwargs):
start = int(time.time())
res = func(*args, **kwargs)
cost = int(time.time()) - start
print(f"{func.__name__} function ran for {cost} s")
if cost - start > max_time:
print(f"{func.__name__} function exceeds max_time")
return res
return wrapper
return decorated
# 5
class InterInt:
def __init__(self):
self.a = 1
def __next__(self):
temp = self.a
self.a += 1
return temp
# 6
class Node(object):
def __init__(self, key, value, _next=None):
self.key = key
self.value = value
self.next = _next
def set_next(self, new_node):
self.next = new_node
class CustomDict:
def __init__(self):
self.key_set = set()
self.key_max_length = 1000
self.key_list = [None for _ in range(self.key_max_length)]
def __hash_func(self, key):
return hash(key) % self.key_max_length
def __getitem__(self, key):
if key not in self.key_set:
raise KeyError(f'{key} not in CustomDict')
key_index = self.__hash_func(key)
node = self.key_list[key_index]
while node:
if node.key == key:
return node.value
node = node.next
def __setitem__(self, key, value):
self.key_set.add(key)
key_index = self.__hash_func(key)
node = self.key_list[key_index]
new_node = Node(key, value)
if not node:
self.key_list[key_index] = new_node
else:
while node:
node = node.next
node.set_next(new_node)
# cdict = CustomDict()
# cdict["a"] = 1
# cdict["b"] = 2
# print(cdict["a"])
# print(cdict["c"])
class LinkedNode(object):
def __init__(self, key, _next=None, pre=None):
self.key = key
self.next = _next
self.pre = pre
def set_next(self, new_node):
self.next = new_node
def set_pre(self, pre):
self.pre = pre
# 7-1
class Solution:
def __init__(self):
# 1 ==> ... ==> 18 ==> 19 ==> 26 ==> ... ==> 30 ==> 25 ==> 31 ==> 32 ==> 33
# ^
# ||
# 24
node_list = [LinkedNode(i) for i in range(1, 34)]
self.head = node_list[0]
# 1 ==> ... ==> 18 ==> 19
for item, next_item in zip(range(0, 32), range(1, 33)):
node_list[item].set_next(node_list[next_item])
node_list[next_item].set_pre(node_list[item])
node_list[25].set_pre(node_list[18])
node_list[29].set_next(node_list[24])
node_list[24].set_next(node_list[30])
node_list[30].set_pre(node_list[24])
node_list[32].set_next(node_list[0])
node_list[0].set_pre(node_list[32])
# # 26 ==> ... ==> 30
# for item, next_item in zip(range(26, 30), range(27, 31)):
# node_list[item].set_next(node_list[next_item])
# node_list[next_item].set_pre(node_list[item])
#
# # 20 ==> ... ==> 24
# for item, next_item in zip(range(20, 24), range(21, 25)):
# node_list[item].set_next(node_list[next_item])
# node_list[next_item].set_pre(node_list[item])
#
# # 19 ==> 20
# node_list[18].set_next(node_list[19])
# node_list[19].set_pre(node_list[18])
#
# # 30 ==> 25
# node_list[29].set_next(node_list[24])
# node_list[24].set_pre(node_list[29])
#
# # 24 ==> 25
# node_list[23].set_next(node_list[24])
# node_list[23].set_pre(node_list[24])
#
# # 25 ==> 31 ==> 32 ==> 33
# node_list[24].set_next(node_list[30])
# node_list[30].set_pre(node_list[24])
# node_list[30].set_next(node_list[31])
# node_list[31].set_pre(node_list[30])
# node_list[31].set_next(node_list[32])
# node_list[32].set_pre(node_list[31])
self.node_list = node_list
def find_next_node(self, current_position: int, step: int) -> int:
node = self.node_list[current_position - 1]
if current_position == 19 and step > 0:
step -= 1
node = self.node_list[25]
if current_position == 25 and step < 0:
step += 1
node = self.node_list[29]
if step > 0:
while node and step:
node = node.next
step -= 1
else:
while node and step != 0:
node = node.pre
step += 1
print(node.key)
return node.key
solution = Solution()
solution.find_next_node(1, 4) # 5
solution.find_next_node(5, -4) # 1
solution.find_next_node(17, 5) # 22
solution.find_next_node(19, 2) # 27
solution.find_next_node(27, -3) # 18
solution.find_next_node(30, 3) # 32
solution.find_next_node(32, -4) # 23
solution.find_next_node(25, -2) # 29
solution.find_next_node(33, 3) # 3
solution.find_next_node(1, -2) # 32
# 7-2
def init_board():
board = [['.' for _ in range(6)] for _ in range(6)]
choice_list = [1, 2, 3, 4]
def helper(i, j):
# 列,行
m, n = 5, 5
if j == n:
# 下一行
return helper(i+1, 0)
if i == m:
return True
if board[i][j] != '.':
return helper(i, j + 1)
for num in choice_list:
if not can_insert(i, j, num):
continue
board[i][j] = num
if helper(i, j+1):
return True
# 撤销选择
board[i][j] = '.'
def can_insert(i, j, num):
# 少于三个数字
if i < 4 or j < 4:
return True
temp_set = set(set(board[i]))
temp_set.remove('.')
temp_set.add(num)
if len(temp_set) == 3:
return True
temp_set1 = set([row[j] for row in board])
temp_set1.remove('.')
temp_set1.add(num)
if len(temp_set1) != 3:
return True
return False
helper(0, 0)
return board
print(init_board())