如何避免递归函数的StackOverflowError

使用显式的对象堆栈和循环，而不是调用堆栈和递归：

void checkBlocks(Block b, int amm) {  Stack<Block> blocks = new Stack<Block>();  blocks.push(b);  while (!blocks.isEmpty()) {    b = blocks.pop();    Block blockDown = (Block) b.getRelative(BlockFace.DOWN);    if (condition)      blocks.push(block);    Block blockUp = (Block) b.getRelative(BlockFace.UP);    if (condition)       blocks.push(block);  }}