Fixed format

Author: javadev

src/main/java/com_github_leetcode/Employee.java

@@ -6,8 +6,10 @@
 public class Employee {
     /** It's the unique id of each node; unique id of this employee */
     public int id;
+
     /** the importance value of this employee */
     public int importance;
+
     /** the id of direct subordinates */
     public List<Integer> subordinates;
 

src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java

@@ -10,6 +10,7 @@
 public class MyQueue {
     private Deque<Integer> left;
     private Deque<Integer> right;
+
     // Initialize your data structure here.
     public MyQueue() {
         left = new ArrayDeque<>();

src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java

@@ -40,6 +40,7 @@ public void update(int i, int v) {
                 bit[i] += v;
             }
         }
+
         // prefix sum query
         private int ps(int j) {
             int ps = 0;

src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java

@@ -15,6 +15,7 @@ public class Solution {
         {{0, -1}, {-1, 0}},
         {{0, 1}, {-1, 0}}
     };
+
     // the idea is you need to check port direction match, you can go to next cell and check whether
     // you can come back.
     public boolean hasValidPath(int[][] grid) {

src/main/java/g2301_2400/s2397_maximum_rows_covered_by_columns/Solution.java

@@ -7,7 +7,7 @@ public class Solution {
     private int ans = 0;
 
     public int maximumRows(int[][] matrix, int numSelect) {
-        dfs(matrix, /*colIndex=*/ 0, numSelect, /*mask=*/ 0);
+        dfs(matrix, /* colIndex= */ 0, numSelect, /* mask= */ 0);
         return ans;
     }