From cf9871802f65e4202e0aabbdf4f4679eb7f1ed8b Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Sat, 4 May 2024 02:52:22 +0300
Subject: [PATCH 1/2] Updated spotless

---
 build.gradle | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/build.gradle b/build.gradle
index 8d62ec66a..9e8becc0c 100644
--- a/build.gradle
+++ b/build.gradle
@@ -1,7 +1,7 @@
 plugins {
     id 'java'
     id 'maven-publish'
-    id 'com.diffplug.spotless' version '6.12.0'
+    id 'com.diffplug.spotless' version '6.25.0'
     id 'org.sonarqube' version '5.0.0.4638'
     id 'jacoco'
 }
@@ -54,7 +54,7 @@ spotless {
         }
         importOrder '\\#', '', '*'
         removeUnusedImports()
-        googleJavaFormat('1.15.0').aosp()
+        googleJavaFormat('1.22.0').aosp()
         toggleOffOn()
         endWithNewline()
     }

From ad592cbe950fa8348862f7adbeacc78f6904c64b Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Sat, 4 May 2024 03:05:02 +0300
Subject: [PATCH 2/2] Fixed format

---
 src/main/java/com_github_leetcode/Employee.java                 | 2 ++
 .../g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java  | 1 +
 .../s0315_count_of_smaller_numbers_after_self/Solution.java     | 1 +
 .../Solution.java                                               | 1 +
 .../s2397_maximum_rows_covered_by_columns/Solution.java         | 2 +-
 5 files changed, 6 insertions(+), 1 deletion(-)

diff --git a/src/main/java/com_github_leetcode/Employee.java b/src/main/java/com_github_leetcode/Employee.java
index b5aa800a0..e76f72449 100644
--- a/src/main/java/com_github_leetcode/Employee.java
+++ b/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;
 
diff --git a/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java b/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
index e42c2a3ff..301c4fced 100644
--- a/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
+++ b/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<>();
diff --git a/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java b/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java
index 19c9ca398..44c4a5c2a 100644
--- a/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java
+++ b/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;
diff --git a/src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java b/src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java
index 72c77c052..73b0ae60d 100644
--- a/src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java
+++ b/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) {
diff --git a/src/main/java/g2301_2400/s2397_maximum_rows_covered_by_columns/Solution.java b/src/main/java/g2301_2400/s2397_maximum_rows_covered_by_columns/Solution.java
index b19466b3b..0ef035dd7 100644
--- a/src/main/java/g2301_2400/s2397_maximum_rows_covered_by_columns/Solution.java
+++ b/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;
     }