种子填充算法用来在封闭曲线形成的环中填充某中颜色，在这里我们只填充黑色。种子填充其实上是图形学中的算法，其原理是：准备一个堆栈，先将要填充的点push进堆栈中；以后，每pop出一个点，将该点涂成黑色，然后按左上右下的顺序查看它的四个相邻点，若为白(表示还没有填充)，则将该邻点push进栈。一直循环，直到堆栈为空。此时，区域内所有的点都被涂成了黑色。这里，我们自己定义了一些堆栈的数据结构和操作，实现了堆栈的初始化、push、pop、判断是否为空、及析构。 -seed filling algorithm used in a closed curve formed by a ring filled with color, here we only filled black. Seed is actually filled with graphics algorithm, and its tenet is : preparing a stack, Filling the first point to push into Stack; After each pop up a point, this point painted black. Press the left, then the right lower in the order View its four adjacent spots, and white (said that it had not yet filled), by being neighbors push into Stack. Has been circulating until the stack is empty. At this point, all the regional point has been Tu became black. Here, our own definition of a stack data structure and operations, the realization of the initial stack, push, pop, to determine whether the air, and destructors.