add DFS

Author: Jiacch

.DS_Store

@@ -0,0 +1,47 @@
+# -*- coding:UTF-8 -*-
+
+# Lake Counting
+
+# data input
+m = 12
+n = 10
+input_arr = [
+    'W........WW.',
+    '.WWW.....WWW',
+    '....WW...WW.',
+    '.........WW.',
+    '.........W..',
+    '..W......W..',
+    '.W.W.....WW.',
+    'W.W.W.....W.',
+    '.W.W......W.',
+    '..W.......W.'
+    ]
+arr = [ [] for i in range(len(input_arr))]
+for i in range(len(input_arr)):
+    for j in range(len(input_arr[i])):
+        arr[i].append(str(input_arr[i][j]))
+
+def DFS(i, j):
+    arr[i][j] = '.'
+    for dx in range(-1, 2):
+        for dy in range(-1, 2):
+            newx = i + dx
+            newy = j + dy
+            if newx>=0 and newy>=0 and newx<n and newy<m and arr[newx][newy]=='W':
+                DFS(newx, newy)
+    return
+    pass
+
+def main():
+    count = 0
+    for x in range(0,n-1):
+        for y in range(0, m-1):
+            if arr[x][y] == 'W':
+                DFS(x, y)
+                count += 1
+    print count
+    pass
+
+if __name__ == '__main__':
+    main()

No.1/DFS_POJ2386.py

@@ -1,2 +1,8 @@
 # Algorithm_Python_Demo
-fundamental algorithm demo by Python
+《挑战程序设计竞赛（第二版）》
+No.1 初级篇
+穷竭搜索
+    DFS：从一个状态开始，不断移动状态，直到无法移动，然后退回到上一状态，继续转移其他状态，不断重复，直到找到最终解。递归函数
+    BFS
+No.2 中级篇
+No.3 高级篇