Commit be11452

committed

添加python版本三

1 parent 2d57993 commit be11452Copy full SHA for be11452

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -278,6 +278,40 @@ class Solution:`
`278`	`278`
`279`	`279`	`return result`
`280`	`280`	```
	`281`	+```python
	`282`	`+# 我们用三个状态去标记每一个格子`
	`283`	`+# 0 代表海水`
	`284`	`+# 1 代表陆地`
	`285`	`+# 2 代表已经访问的陆地`
	`286`	`+class Solution:`
	`287`	`+ def traversal(self, grid, i, j):`
	`288`	`+ m = len(grid)`
	`289`	`+ n = len(grid[0])`
	`290`	`+`
	`291`	`+ if i < 0 or j < 0 or i >= m or j >= n:`
	`292`	`+ return # 越界了`
	`293`	`+ elif grid[i][j] == "2" or grid[i][j] == "0":`
	`294`	`+ return`
	`295`	`+`
	`296`	`+ grid[i][j] = "2"`
	`297`	`+ self.traversal(grid, i - 1, j) # 往上走`
	`298`	`+ self.traversal(grid, i + 1, j) # 往下走`
	`299`	`+ self.traversal(grid, i, j - 1) # 往左走`
	`300`	`+ self.traversal(grid, i, j + 1) # 往右走`
	`301`	`+`
	`302`	`+ def numIslands(self, grid: List[List[str]]) -> int:`
	`303`	`+ res = 0`
	`304`	`+`
	`305`	`+`
	`306`	`+ for i in range(len(grid)):`
	`307`	`+ for j in range(len(grid[0])):`
	`308`	`+ if grid[i][j] == "1":`
	`309`	`+ res += 1`
	`310`	`+ self.traversal(grid, i, j)`
	`311`	`+`
	`312`	`+ return res`
	`313`	+```
	`314`	`+`
`281`	`315`	`### JavaScript`
`282`	`316`
`283`	`317`	```javascript

Comments

(0)