Q 9.7 paint fill

最新推荐文章于 2025-10-23 11:07:12 发布

原创最新推荐文章于 2025-10-23 11:07:12 发布 · 398 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Recursion

Cracking the coding interview 专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一个简单的图像填充算法实现，该算法通过递归的方式改变指定起始位置周围的颜色，直至遇到边界。文中提供了详细的代码示例，展示了如何在一个二维颜色数组上应用此算法。

Q: Implement the “paint fill” function that one might see on many image editing programs. That is, given a screen (represented by a 2-dimensional array of Colors), a point, and a new color, fill in the surrounding area until you hit a border of that color.

A:由当前位置向上下左右扩展即可，终止条件是坐标越界或者颜色为目标颜色。

enum Color {
	Black, White, Red, Yellow, Green
};

bool paint_fill(color **screen, int m, int n, int x, int y, color c){
    if(x<0 || x>=m || y<0 || y>=n) return false;
    if(screen[x][y] == c) return false;
    else{
        screen[x][y] = c;
        paint_fill(screen, m, n, x-1, y, c);
        paint_fill(screen, m, n, x+1, y, c);
        paint_fill(screen, m, n, x, y-1, c);
        paint_fill(screen, m, n, x, y+1, c);
    }
    return true;
}