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
|
# POJ No.2386
class poj2386(object):
def __init__(self, map):
self.row_num = 10
self.col_num = 12
self.m = self.matrix(map.replace('\n',''))
self.walked_set = set()
self.dfs_num = 0
def matrix(self, map):
'''
desc: 字符串转数组，方便遍历
:return ['row0','row1'...]
'''
col_num = 0
matrix = []
for r in range(self.row_num):
matrix.append(map[col_num: col_num + self.col_num])
col_num = col_num + self.col_num
return matrix
def dfs(self, x, y, char):
'''
desc:用递归实现搜索范围内相同字符
:param x:
:param y:
:param char:
:return:
'''
if 0 > x or 0 > y or x >= self.row_num or y >= self.col_num : # 越界检查
return
if tuple([x,y]) in self.walked_set: # 重复遍历检查
return
if char != self.m[x][y]: # 目标字符检查
return
self.walked_set.add(tuple([x, y]))
self.dfs(x + 1, y, char) # x
self.dfs(x, y + 1, char) # y
self.dfs(x - 1, y, char) # -x
self.dfs(x, y - 1, char) # -y
self.dfs(x + 1, y + 1, char) # Ⅰ
self.dfs(x + 1, y - 1, char) # Ⅱ
self.dfs(x - 1, y - 1, char) # Ⅲ
self.dfs(x - 1, y + 1, char) # Ⅳ
return
def walk(self):
'''
desc: 对矩阵遍历
:return:
'''
for x in range(self.row_num-1):
for y in range(self.col_num-1):
if tuple([x, y]) in self.walked_set:
continue
if self.m[x][y] == '.':
continue
if self.m[x][y] == 'W':
self.dfs(x, y, 'W')
self.dfs_num +=1
return self.dfs_num
if __name__ == '__main__':
map = '''
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
'''
c = poj2386(map)
dfs_num = c.walk()
print(dfs_num)
|