LeetCode 733 Flood Fill 洪水填充 C语言 DFS 深度优先搜索算法

题目

An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).

Given a coordinate (sr, sc) representing the starting pixel (row and column) of the flood fill, and a pixel value newColor, “flood fill” the image.

To perform a “flood fill”, consider the starting pixel, plus any pixels connected 4-directionally to the starting pixel of the same color as the starting pixel, plus any pixels connected 4-directionally to those pixels (also with the same color as the starting pixel), and so on. Replace the color of all of the aforementioned pixels with the newColor.

At the end, return the modified image.
效果类似下图：
白色为要改的颜色块，橙黄色为新颜色。
要注意的是，颜色传导只会沿着相同颜色的方块传导，只会“传染”相同色块。也就是说，就算把下图的黑色色块颜色全变为了要改的颜色，结果也和原来黑色的一样。只会沿着起始点相邻的（上下左右四个方向）颜色和起始点起始颜色相同的方块传导。

起始点起始颜色为白色，则查看相邻上下左右格子，若是白色，则改为橙黄色，并将改色后的点视为新的起始点，查看相邻上下左右格子，若是白色，则改为橙黄色。若不是白色，则该方向无效。

Example 1:
Input:

image = [[1,1,1],[1,1,0],[1,0,1]]
sr = 1, sc = 1, newColor = 2

Output:

[[2,2,2],[2,2,0],[2,0,1]]

Explanation:
From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected
by a path of the same color as the starting pixel are colored with the new color.
Note the bottom corner is not colored 2, because it is not 4-directionally connected
to the starting pixel.

Note:
The length of image and image[0] will be in the range [1, 50].
The given starting pixel will satisfy 0 <= sr < image.length and 0 <= sc < image[0].length.
The value of each color in image[i][j] and newColor will be an integer in [0, 65535].

解题思路

用深度查找算法DFS实现。由起始数据点开始，查看周围相邻的四个点（上下左右），看这四个点的颜色是否为所要改的颜色，若是，则把该点颜色改为新颜色并以该点为新起点继续查找周围相邻的四点，以此类推，直到查到边界或者点的颜色值不等于所要更改的颜色时，return上一个点，继续完成上一个点的其他方向的查找。
------------------------------------------------代码如下-------------------------------------------------

代码

C语言

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */


void DFS(int