二维数组递归(2D array Recursion)

二维数组递归(2D array Recursion)

所以我正在尝试建立一个泡沫破碎机程序。 游戏的工作方式是它有一个有多种颜色的棋盘。 所有斑点从那个地方（水平和垂直）脱落而不是diaganol和那些你在新斑点附近咀嚼的斑点直到没有斑点

public void setSurroundingSimilarToTrue(int row, int col, int correctColor){ if(row >= 0 && row < this.myBoard.length && col >= 0 && col < this.myBoard.length) if(this.myBoard[row][col].getColorValue() == correctColor){ this.myBoard[row][col].setStatusTrue(); //System.out.println(row); setSurroundingSimilarToTrue(row - 1, col, correctColor); setSurroundingSimilarToTrue(row + 1, col, correctColor); setSurroundingSimilarToTrue(row, col - 1, correctColor); setSurroundingSimilarToTrue(row, col + 1, correctColor); } }

这就是我所做的，我不知道什么是错的。

So I am trying to build a bubble breaker program. The way the game works is that it has a board with several colors. all spots coming off that spot (horizontal and vertical) not diaganol and off those you chech all around the new spot until no spots left

public void setSurroundingSimilarToTrue(int row, int col, int correctColor){ if(row >= 0 && row < this.myBoard.length && col >= 0 && col < this.myBoard.length) if(this.myBoard[row][col].getColorValue() == correctColor){ this.myBoard[row][col].setStatusTrue(); //System.out.println(row); setSurroundingSimilarToTrue(row - 1, col, correctColor); setSurroundingSimilarToTrue(row + 1, col, correctColor); setSurroundingSimilarToTrue(row, col - 1, correctColor); setSurroundingSimilarToTrue(row, col + 1, correctColor); } }

This is what I did and I cant see whats wrong.

最满意答案

你的代码有无限的递归。 在进行递归之前，检查当前row, col位置是否尚未设置为True 。

You have infinite recursion with your code. Before doing recursion, check if the current row, col position isn't already set to True.