Fixed readmes.

Author: javadev

src/main/java/g0701_0800/s0773_sliding_puzzle/readme.md

@@ -95,7 +95,7 @@ public class Solution {
         Set<String> seen = new HashSet<>();
         Queue<Node> q = new LinkedList<>();
         q.add(new Node(sb.toString(), 0, y, x));
-        int[][] dir = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
+        int[][] dir = { {1, 0}, {-1, 0}, {0, 1}, {0, -1}};
         while (!q.isEmpty()) {
             Node next = q.poll();
             String s = next.board;

src/main/java/g0801_0900/s0803_bricks_falling_when_hit/readme.md

@@ -75,7 +75,7 @@ Hence the result is [0,0].
 
 ```java
 public class Solution {
-    private final int[][] dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
+    private final int[][] dirs = { {1, 0}, {-1, 0}, {0, 1}, {0, -1}};
 
     public int[] hitBricks(int[][] grid, int[][] hits) {
         int cols = grid[0].length;

src/main/java/g0901_1000/s0934_shortest_bridge/readme.md

@@ -51,7 +51,7 @@ public class Solution {
         }
     }
 
-    private int[][] dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
+    private int[][] dirs = { {1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
     public int shortestBridge(int[][] grid) {
         ArrayDeque<Pair> q = new ArrayDeque<>();

src/main/java/g1001_1100/s1001_grid_illumination/readme.md

@@ -66,7 +66,7 @@ public class Solution {
             int cell = row1 * n + col1;
             cellno.put(cell, cellno.getOrDefault(cell, 0) + 1);
         }
-        int[][] dir = {{-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}};
+        int[][] dir = { {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}};
         int[] ans = new int[queries.length];
         for (int i = 0; i < queries.length; i++) {
             int row1 = queries[i][0];

src/main/java/g1001_1100/s1041_robot_bounded_in_circle/readme.md

@@ -97,7 +97,7 @@ Based on that, we return true.
 ```java
 public class Solution {
     public boolean isRobotBounded(String instructions) {
-        int[][] dir = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
+        int[][] dir = { {0, 1}, {-1, 0}, {0, -1}, {1, 0}};
         int i = 0;
         int x = 0;
         int y = 0;

src/main/java/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/readme.md

@@ -80,7 +80,7 @@ public class Solution {
     private int n;
     private int m;
     private char[][] grid;
-    private final int[][] dirs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
+    private final int[][] dirs = { {1, 0}, {0, 1}, {-1, 0}, {0, -1}};
 
     public int minPushBox(char[][] grid) {
         n = grid.length;

src/main/java/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/readme.md

@@ -51,7 +51,7 @@ public class Solution {
             return 0;
         }
         // 4 potential moves:
-        int[][] moves = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
+        int[][] moves = { {1, 0}, {-1, 0}, {0, 1}, {0, -1}};
         int m = grid.length;
         int n = grid[0].length;
         // use obs to record the min total obstacles when traverse to the position

src/main/java/g1301_1400/s1301_number_of_paths_with_max_score/readme.md

@@ -38,7 +38,7 @@ In case there is no path, return `[0, 0]`.
 import java.util.List;
 
 public class Solution {
-    private static final int[][] DIRECTIONS = new int[][] {{1, 0}, {0, 1}, {1, 1}};
+    private static final int[][] DIRECTIONS = new int[][] { {1, 0}, {0, 1}, {1, 1}};
 
     public int[] pathsWithMaxScore(List<String> board) {
         int rows = board.size();

src/main/java/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/readme.md

@@ -60,7 +60,7 @@ import java.util.Objects;
 import java.util.Queue;
 
 public class Solution {
-    private final int[][] dir = new int[][] {{0, 0}, {0, 1}, {0, -1}, {1, 0}, {-1, 0}};
+    private final int[][] dir = new int[][] { {0, 0}, {0, 1}, {0, -1}, {1, 0}, {-1, 0}};
 
     public int minCost(int[][] grid) {
         int[][] visited = new int[grid.length][grid[0].length];

src/main/java/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/readme.md

@@ -45,7 +45,7 @@ import java.util.List;
 
 @SuppressWarnings("java:S107")
 public class Solution {
-    private final int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
+    private final int[][] dirs = { {0, 1}, {0, -1}, {1, 0}, {-1, 0}};
 
     public int minDays(int[][] grid) {
         int m = grid.length;