733 Flood Fill

最新推荐文章于 2022-04-11 11:40:17 发布

MVincent

最新推荐文章于 2022-04-11 11:40:17 发布

阅读量265

点赞数

分类专栏： leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/MRxjh/article/details/83113434

版权

leetcode 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

python:

class Solution:
    def floodFill(self, image, sr, sc, newColor):
        """
        :type image: List[List[int]]
        :type sr: int
        :type sc: int
        :type newColor: int
        :rtype: List[List[int]]
        """
        rows, columns = len(image), len(image[0])
        same = image[sr][sc]
        if newColor is same:
            return image
        def Fill(row, column):
            if 0<=row<rows and 0<=column<columns and image[row][column] == same:
                image[row][column] = newColor
            else:
                return
            Fill(row+1, column)
            Fill(row-1, column)
            Fill(row, column+1)
            Fill(row, column-1)
        Fill(sr, sc)
        return image

c++:

class Solution {
private:
    int m_num;
    int m_newColor;
    int rows;
    int cols;
public:
    vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
        m_num = image[sr][sc];
        if (m_num == newColor)
            return image;
        rows = image.size();
        cols = image[0].size();
        m_newColor = newColor;
        
        fill(sr, sc, image);
        return image;
        
    }
    
    void fill(int row, int col, vector<vector<int>>& image){
        if( row<0 || row>=rows || col<0 || col>=cols || image[row][col]!=m_num)
            return;
        image[row][col] = m_newColor;
        fill(row+1, col, image);
        fill(row-1, col, image);
        fill(row, col+1, image);
        fill(row, col-1, image);
    }
};