The Spotless Gradle plugin has been added

Author: javadev

.github/workflows/gradle.yml

@@ -24,4 +24,4 @@ jobs:
         java-version: '17'
         cache: 'gradle'
     - name: Build with Gradle
-      run: chmod +x gradlew && ./gradlew build
+      run: chmod +x gradlew && ./gradlew spotlessCheck build

build.gradle

@@ -1,5 +1,6 @@
 plugins {
     id 'java'
+    id 'com.diffplug.spotless' version '6.25.0'
     id 'checkstyle'
 }
 
@@ -54,3 +55,18 @@ checkstyle {
     toolVersion = '6.17'
     config = rootProject.resources.text.fromFile('fishercoder_checkstyle.xml')
 }
+
+spotless {
+    java {
+        encoding 'UTF-8'
+        target fileTree(projectDir) {
+            include '**/src/**/*.java'
+            exclude '**/build/**'
+        }
+        importOrder '\\#', '', '*'
+        removeUnusedImports()
+        googleJavaFormat('1.22.0').aosp()
+        toggleOffOn()
+        endWithNewline()
+    }
+}

src/main/java/com/fishercoder/common/classes/Employee.java

@@ -3,18 +3,13 @@
 import java.util.List;
 
 public class Employee {
-    /**
-     * It's the unique id of each node;
-     * unique id of this employee
-     */
+    /** It's the unique id of each node; unique id of this employee */
     public int id;
-    /**
-     * the importance value of this employee
-     */
+
+    /** the importance value of this employee */
     public int importance;
-    /**
-     * the id of direct subordinates
-     */
+
+    /** the id of direct subordinates */
     public List<Integer> subordinates;
 
     public Employee(int id, int importance, List<Integer> subordinates) {

src/main/java/com/fishercoder/common/classes/Interval.java

@@ -1,8 +1,6 @@
 package com.fishercoder.common.classes;
 
-/**
- * This is a class used by one OJ problem: MeetingRooms
- */
+/** This is a class used by one OJ problem: MeetingRooms */
 public class Interval implements Comparable<Interval> {
     public int start;
     public int end;
@@ -45,7 +43,7 @@ public Interval(int s, int e) {
     @Override
     public int compareTo(Interval o) {
         int compareStart = o.start;
-        //ascending order
+        // ascending order
         return this.start - compareStart;
     }
 

src/main/java/com/fishercoder/common/classes/ListNode.java

@@ -1,7 +1,6 @@
 package com.fishercoder.common.classes;
 
 import com.fishercoder.common.utils.CommonUtils;
-
 import java.util.List;
 
 /**
@@ -86,5 +85,4 @@ public int hashCode() {
     public String toString() {
         return "ListNode{" + "val=" + val + ", next=" + next + '}';
     }
-
 }

src/main/java/com/fishercoder/common/classes/NestedInteger.java

@@ -62,5 +62,4 @@ public static String printNi(NestedInteger thisNi, StringBuilder sb) {
         sb.append("]");
         return sb.toString();
     }
-
 }

src/main/java/com/fishercoder/common/classes/Node.java

@@ -22,11 +22,9 @@ public Node(int val, List<Node> children) {
         this.children = children;
     }
 
-    //todo: implement this method
+    // todo: implement this method
 
-    /**
-     * return a N-ary tree based on the preorder values
-     */
+    /** return a N-ary tree based on the preorder values */
     public static Node createNaryTree(List<Integer> preorderValues) {
         return null;
     }

src/main/java/com/fishercoder/common/classes/Point.java

@@ -1,8 +1,6 @@
 package com.fishercoder.common.classes;
 
-/**
- * Created by fishercoder on 12/31/16.
- */
+/** Created by fishercoder on 12/31/16. */
 public class Point {
     public int x;
     public int y;

src/main/java/com/fishercoder/common/classes/UndirectedGraphNode.java

@@ -3,9 +3,7 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * Created by fishercoder1534 on 9/30/16.
- */
+/** Created by fishercoder1534 on 9/30/16. */
 public class UndirectedGraphNode {
     public int val;
     public List<UndirectedGraphNode> neighbors;

src/main/java/com/fishercoder/common/utils/BTreePrinter.java

@@ -6,8 +6,8 @@
 
 /**
  * Copied this class from
- * http://stackoverflow.com/questions/4965335/how-to-print-binary-tree-diagram
- * This is an awesome one! It prints out the tree in a very nice fashion.
+ * http://stackoverflow.com/questions/4965335/how-to-print-binary-tree-diagram This is an awesome
+ * one! It prints out the tree in a very nice fashion.
  */
 public class BTreePrinter {
 
@@ -55,8 +55,7 @@ private static <T extends Comparable<?>> void printNodeInternal(
             for (int j = 0; j < nodes.size(); j++) {
                 BTreePrinter.printWhitespaces(firstSpaces - i);
                 if (nodes.get(j) == null) {
-                    BTreePrinter.printWhitespaces(endgeLines + endgeLines + i
-                            + 1);
+                    BTreePrinter.printWhitespaces(endgeLines + endgeLines + i + 1);
                     continue;
                 }
 
@@ -94,8 +93,7 @@ private static <T extends Comparable<?>> int maxLevel(Node<T> node) {
             return 0;
         }
 
-        return Math.max(BTreePrinter.maxLevel(node.left),
-                BTreePrinter.maxLevel(node.right)) + 1;
+        return Math.max(BTreePrinter.maxLevel(node.left), BTreePrinter.maxLevel(node.right)) + 1;
     }
 
     private static <T> boolean isAllElementsNull(List<T> list) {
@@ -171,7 +169,6 @@ private static Node<Integer> test2() {
         return root;
     }
 
-
     public static class Node<T extends Comparable<?>> {
         Node<T> left;
         Node<T> right;
@@ -181,5 +178,4 @@ public Node(T data) {
             this.data = data;
         }
     }
-
-}
+}