From 302db81bb8c3b224cc0257fb2dee61478d8b56c8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Aitor=20Fidalgo=20S=C3=A1nchez?=
 <64830228+aitorfi@users.noreply.github.com>
Date: Sat, 8 Oct 2022 13:10:34 +0200
Subject: [PATCH] Fixes #3323 Javadoc generation errors in backtracking
 algorithms (#3326)

---
 .../thealgorithms/backtracking/FloodFill.java |  1 -
 .../backtracking/MazeRecursion.java           | 27 +++++++++----------
 2 files changed, 13 insertions(+), 15 deletions(-)

diff --git a/src/main/java/com/thealgorithms/backtracking/FloodFill.java b/src/main/java/com/thealgorithms/backtracking/FloodFill.java
index aeafde333..0a7439333 100644
--- a/src/main/java/com/thealgorithms/backtracking/FloodFill.java
+++ b/src/main/java/com/thealgorithms/backtracking/FloodFill.java
@@ -37,7 +37,6 @@ public class FloodFill {
      * @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 oldColor The old color which is to be replaced in the image
-     * @return
      */
     public static void floodFill(
         int[][] image,
diff --git a/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java b/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java
index 60f02b902..0e1cd308d 100644
--- a/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java
+++ b/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java
@@ -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
     /**
-     *
-     * @Description
+     * 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
+     * 
      * @author OngLipWei
-     * @date Jun 23, 202111:36:14 AM
+     * @version Jun 23, 2021 11:36:14 AM
      * @param map The maze
      * @param i   x coordinate of your ball(target)
      * @param j   y coordinate of your ball(target)