algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 17:29:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixes #3323 Javadoc generation errors in backtracking algorithms (#3326)

Browse Source
This commit is contained in:
Aitor Fidalgo Sánchez
2022-10-08 13:10:34 +02:00
committed by GitHub
parent 471d2c0b5d
commit 302db81bb8
2 changed files with 13 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
src/main/java/com/thealgorithms/backtracking/FloodFill.java
View File

@ -37,7 +37,6 @@ public class FloodFill {
* @param y The y co-ordinate at which color is to be filled * @param y The y co-ordinate at which color is to be filled
* @param newColor The new color which to be filled in the image * @param newColor The new color which to be filled in the image
* @param oldColor The old color which is to be replaced in the image * @param oldColor The old color which is to be replaced in the image
* @return
*/ */
public static void floodFill( public static void floodFill(
int[][] image, int[][] image,

27
src/main/java/com/thealgorithms/backtracking/MazeRecursion.java
View File

@ -73,22 +73,21 @@ public class MazeRecursion {
} }
} }
// Using recursive path finding to help the ball find its way in the maze
// Description：
// 1. map (means the maze)
// 2. i, j (means the initial coordinate of the ball in the maze)
// 3. if the ball can reach the end of maze, that is position of map[6][5],
// means the we have found a path for the ball
// 4. Additional Information： 0 in the map[i][j] means the ball has not gone
// through this position, 1 means the wall, 2 means the path is feasible, 3
// means the ball has gone through the path but this path is dead end
// 5. We will need strategy for the ball to pass through the maze for example:
// Down -> Right -> Up -> Left, if the path doesn't work, then backtrack
/** /**
* * Using recursive path finding to help the ball find its way in the maze
* @Description * Description：
* 1. map (means the maze)
* 2. i, j (means the initial coordinate of the ball in the maze)
* 3. if the ball can reach the end of maze, that is position of map[6][5],
* means the we have found a path for the ball
* 4. Additional Information： 0 in the map[i][j] means the ball has not gone
* through this position, 1 means the wall, 2 means the path is feasible, 3
* means the ball has gone through the path but this path is dead end
* 5. We will need strategy for the ball to pass through the maze for example:
* Down -> Right -> Up -> Left, if the path doesn't work, then backtrack
*
* @author OngLipWei * @author OngLipWei
* @date Jun 23, 202111:36:14 AM * @version Jun 23, 2021 11:36:14 AM
* @param map The maze * @param map The maze
* @param i x coordinate of your ball(target) * @param i x coordinate of your ball(target)
* @param j y coordinate of your ball(target) * @param j y coordinate of your ball(target)