Refactor Code Style (#4151)

src/test/java/com/thealgorithms/backtracking/AllPathsFromSourceToTargetTest.java

@@ -9,7 +9,7 @@ public class AllPathsFromSourceToTargetTest {
     @Test
     void testForFirstCase() {
         int vertices = 4;
-        int a[][] = {{0,1},{0,2},{0,3},{2,0},{2,1},{1,3}};
+        int[][] a = {{0,1},{0,2},{0,3},{2,0},{2,1},{1,3}};
         int source = 2;
         int destination = 3;
         List<List<Integer>> list2 = List.of(List.of(2, 0, 1, 3),List.of(2, 0, 3),List.of(2, 1, 3));
@@ -21,7 +21,7 @@ public class AllPathsFromSourceToTargetTest {
     @Test
     void testForSecondCase() {
         int vertices = 5;
-        int a[][] = {{0,1},{0,2},{0,3},{2,0},{2,1},{1,3},{1,4},{3,4},{2,4}};
+        int[][] a = {{0,1},{0,2},{0,3},{2,0},{2,1},{1,3},{1,4},{3,4},{2,4}};
         int source = 0;
         int destination = 4;
         List<List<Integer>> list2 = List.of(List.of(0, 1, 3, 4),List.of(0, 1, 4),List.of(0, 2, 1, 3, 4),List.of(0, 2, 1, 4),List.of(0, 2, 4),List.of(0, 3, 4));
@@ -33,7 +33,7 @@ public class AllPathsFromSourceToTargetTest {
     @Test
     void testForThirdCase() {
         int vertices = 6;
-        int a[][] = {{1,0},{2,3},{0,4},{1,5},{4,3},{0,2},{0,3},{1,2},{0,5},{3,4},{2,5},{2,4}};
+        int[][] a = {{1,0},{2,3},{0,4},{1,5},{4,3},{0,2},{0,3},{1,2},{0,5},{3,4},{2,5},{2,4}};
         int source = 1;
         int destination = 5;
         List<List<Integer>> list2 = List.of(List.of(1, 0, 2, 5),List.of(1, 0, 5),List.of(1, 5),List.of(1, 2, 5));
@@ -45,7 +45,7 @@ public class AllPathsFromSourceToTargetTest {
     @Test
     void testForFourthcase() {
         int vertices = 3;
-        int a[][] = {{0,1},{0,2},{1,2}};
+        int[][] a = {{0,1},{0,2},{1,2}};
         int source = 0;
         int destination = 2;
         List<List<Integer>> list2 = List.of(List.of(0, 1, 2),List.of(0, 2));

src/test/java/com/thealgorithms/backtracking/FloodFillTest.java

@@ -8,8 +8,8 @@ class FloodFillTest {
 
     @Test
     void testForEmptyImage() {
-        int image[][] = {};
-        int expected[][] = {};
+        int[][] image = {};
+        int[][] expected = {};
 
         FloodFill.floodFill(image, 4, 5, 3, 2);
         assertArrayEquals(expected, image);
@@ -17,8 +17,8 @@ class FloodFillTest {
 
     @Test
     void testForSingleElementImage() {
-        int image[][] = { { 1 } };
-        int expected[][] = { { 3 } };
+        int[][] image = { { 1 } };
+        int[][] expected = { { 3 } };
 
         FloodFill.floodFill(image, 0, 0, 3, 1);
         assertArrayEquals(expected, image);
@@ -26,7 +26,7 @@ class FloodFillTest {
 
     @Test
     void testForImageOne() {
-        int image[][] = {
+        int[][] image = {
             { 0, 0, 0, 0, 0, 0, 0 },
             { 0, 3, 3, 3, 3, 0, 0 },
             { 0, 3, 1, 1, 5, 0, 0 },
@@ -36,7 +36,7 @@ class FloodFillTest {
             { 0, 0, 0, 3, 3, 3, 3 },
         };
 
-        int expected[][] = {
+        int[][] expected = {
             { 0, 0, 0, 0, 0, 0, 0 },
             { 0, 3, 3, 3, 3, 0, 0 },
             { 0, 3, 2, 2, 5, 0, 0 },
@@ -52,7 +52,7 @@ class FloodFillTest {
 
     @Test
     void testForImageTwo() {
-        int image[][] = {
+        int[][] image = {
             { 0, 0, 1, 1, 0, 0, 0 },
             { 1, 1, 3, 3, 3, 0, 0 },
             { 1, 3, 1, 1, 5, 0, 0 },
@@ -62,7 +62,7 @@ class FloodFillTest {
             { 0, 0, 0, 1, 3, 1, 3 },
         };
 
-        int expected[][] = {
+        int[][] expected = {
             { 0, 0, 2, 2, 0, 0, 0 },
             { 2, 2, 3, 3, 3, 0, 0 },
             { 2, 3, 2, 2, 5, 0, 0 },
@@ -78,13 +78,13 @@ class FloodFillTest {
 
     @Test
     void testForImageThree() {
-        int image[][] = {
+        int[][] image = {
             { 1, 1, 2, 3, 1, 1, 1 },
             { 1, 0, 0, 1, 0, 0, 1 },
             { 1, 1, 1, 0, 3, 1, 2 },
         };
 
-        int expected[][] = {
+        int[][] expected = {
             { 4, 4, 2, 3, 4, 4, 4 },
             { 4, 0, 0, 4, 0, 0, 4 },
             { 4, 4, 4, 0, 3, 4, 2 },

src/test/java/com/thealgorithms/backtracking/MazeRecursionTest.java

@@ -45,7 +45,7 @@ public class MazeRecursionTest {
         MazeRecursion.setWay(map, 1, 1);
         MazeRecursion.setWay2(map2, 1, 1);
 
-        int expectedMap[][] = new int[][] {
+        int[][] expectedMap = new int[][] {
             { 1, 1, 1, 1, 1, 1, 1 },
             { 1, 2, 0, 0, 0, 0, 1 },
             { 1, 2, 2, 2, 0, 0, 1 },
@@ -56,7 +56,7 @@ public class MazeRecursionTest {
             { 1, 1, 1, 1, 1, 1, 1 },
         };
 
-        int expectedMap2[][] = new int[][] {
+        int[][] expectedMap2 = new int[][] {
             { 1, 1, 1, 1, 1, 1, 1 },
             { 1, 2, 2, 2, 2, 2, 1 },
             { 1, 0, 0, 0, 0, 2, 1 },