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

Make code more idiomatic (#4249)

Browse Source
This commit is contained in:
Ranjeet Kumar Jena
2023-07-23 16:21:52 +05:30
committed by GitHub
parent b1ba262b64
commit 1afc4cc319
9 changed files with 22 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -37,16 +37,14 @@ public class MazeRecursion {
// clone another map for setWay2 method
for (int i = 0; i < map.length; i++) {
for (int j = 0; j < map[i].length; j++) {
map2[i][j] = map[i][j];
}
System.arraycopy(map[i], 0, map2[i], 0, map[i].length);
}
// By using recursive backtracking to let your ball(target) find its way in the
// maze
// The first parameter is the map
// Second parameter is x coordinate of your target
// Thrid parameter is the y coordinate of your target
// Third parameter is the y coordinate of your target
setWay(map, 1, 1);
setWay2(map2, 1, 1);
@@ -107,14 +105,14 @@ public class MazeRecursion {
return true;
} else {
// means that the current point is the dead end, the ball cannot proceed, set
// the current point to 3 and return false, the backtraking will start, it will
// the current point to 3 and return false, the backtracking will start, it will
// go to the previous step and check for feasible path again
map[i][j] = 3;
return false;
}
} else { // if the map[i][j] != 0 , it will probably be 1,2,3, return false because the
// ball cannot hit the wall, cannot go to the path that has gone though before,
// and cannot head to deadend.
// and cannot head to deadened.
return false;
}
}
@@ -138,13 +136,13 @@ public class MazeRecursion {
return true;
} else {
// means that the current point is the dead end, the ball cannot proceed, set
// the current point to 3 and return false, the backtraking will start, it will
// the current point to 3 and return false, the backtracking will start, it will
// go to the previous step and check for feasible path again
map[i][j] = 3;
return false;
}
} else { // if the map[i][j] != 0 , it will probably be 1,2,3, return false because the
// ball cannot hit the wall, cannot go to the path that has gone though before,
// ball cannot hit the wall, cannot go to the path that has gone through before,
// and cannot head to deadend.
return false;
}