9.7 paintfill 抄写书

最新推荐文章于 2021-05-13 01:20:01 发布

原创最新推荐文章于 2021-05-13 01:20:01 发布 · 256 阅读

0 ·

CC 4.0 BY-SA版权

cc150 专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个常见的图像编辑功能——“油漆桶”填充算法的具体实现。该算法能够在二维颜色数组上根据指定位置和新颜色，递归地填充直到遇到不同颜色为止。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Implement the "paint fill" function that one might see on many image editing
programs. That is, given a screen (represented by a two-dimensional array of colors),
a point, and a new color, fill in the surrounding area until the color changes from the

original color.

soln

enum Color{ red, yellow, blue, green, white ;}

boolean helper (Color [][] screen, int x, int y, Color ncolor, Color ocolor) {

if ( x<0 || x>= screen[0].length() || y<0 || y>=screen.length())

return false;

if (screen[y][x] == ocolor) {

screen[y][x] = ncolor;

helper (screen, x+1,y, ncolor, ocolor);

helper (screen, x-1,y, ncolor, ocolor);

helper (screen, x,y+1, ncolor, ocolor);

helper (screen, x,y-1, ncolor, ocolor);
} return true;