Python 岛屿问题

import numpy as np
import pandas as pd
# from pydantic
nums = [
  [1, 1, 0, 0, 0],
  [0, 1, 0, 0, 1],
  [0, 0, 0, 1, 1],
  [0, 0, 0, 0, 0],
  [0, 0, 0, 0, 1]
]

class Solution(object):
    def numIslands(self, grid):
        row = len(grid)
        if row == 0 or grid == None:
            return 0
        col = len(grid[0])
        count = 0
        for i in range(row):
            for j in range(col):
                if grid[i][j] == 1:
                    self.dfsFind(grid, i, j, row, col)
                    count += 1
                    print(count)
        return count
    def dfsFind(self, grid, i, j, row, col):
        print(i,j,row,col)
        #   [1, 1, 0, 0, 0],
        #   [0, 1, 0, 0, 1],
        #   [0, 0, 0, 1, 1],
        #   [0, 0, 0, 0, 0],
        #   [0, 0, 0, 0, 1]
        if grid[i][j] == 1:
            grid[i][j] = 0
            if i - 1 >= 0:
                grid = self.dfsFind(grid, i - 1, j, row, col)
            if i + 1 < row:
                grid = self.dfsFind(grid, i + 1, j, row, col)
            if j - 1 >= 0:
                grid = self.dfsFind(grid, i, j - 1, row, col)
            if j + 1 < col:
                grid = self.dfsFind(grid, i, j + 1, row, col)
        return grid

a=Solution()
a.numIslands(nums)

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值