Format the Java codes with the Reat Hat extension.

codes/java/include/ListNode.java

@@ -6,9 +6,7 @@
 
 package include;
 
-/**
- * Definition for a singly-linked list node
- */
+/* Definition for a singly-linked list node */
 public class ListNode {
     public int val;
     public ListNode next;
@@ -16,12 +14,8 @@ public class ListNode {
     public ListNode(int x) {
         val = x;
     }
-    
-    /**
-     * Generate a linked list with an array
-     * @param arr
-     * @return
-     */
+
+    /* Generate a linked list with an array */
     public static ListNode arrToLinkedList(int[] arr) {
         ListNode dum = new ListNode(0);
         ListNode head = dum;
@@ -32,12 +26,7 @@ public class ListNode {
         return dum.next;
     }
 
-    /**
-     * Get a list node with specific value from a linked list
-     * @param head
-     * @param val
-     * @return
-     */
+    /* Get a list node with specific value from a linked list */
     public static ListNode getListNode(ListNode head, int val) {
         while (head != null && head.val != val) {
             head = head.next;

codes/java/include/PrintUtil.java

@@ -8,7 +8,6 @@ package include;
 
 import java.util.*;
 
-
 class Trunk {
     Trunk prev;
     String str;
@@ -21,11 +20,7 @@ class Trunk {
 
 public class PrintUtil {
 
-    /**
-     * Print a matrix (Array)
-     * @param <T>
-     * @param matrix
-     */
+    /* Print a matrix (Array) */
     public static <T> void printMatrix(T[][] matrix) {
         System.out.println("[");
         for (T[] row : matrix) {
@@ -34,11 +29,7 @@ public class PrintUtil {
         System.out.println("]");
     }
 
-    /**
-     * Print a matrix (List)
-     * @param <T>
-     * @param matrix
-     */
+    /* Print a matrix (List) */
     public static <T> void printMatrix(List<List<T>> matrix) {
         System.out.println("[");
         for (List<T> row : matrix) {
@@ -47,10 +38,7 @@ public class PrintUtil {
         System.out.println("]");
     }
 
-    /**
-     * Print a linked list
-     * @param head
-     */
+    /* Print a linked list */
     public static void printLinkedList(ListNode head) {
         List<String> list = new ArrayList<>();
         while (head != null) {
@@ -64,18 +52,12 @@ public class PrintUtil {
      * The interface of the tree printer
      * This tree printer is borrowed from TECHIE DELIGHT
      * https://www.techiedelight.com/c-program-print-binary-tree/
-     * @param root
      */
     public static void printTree(TreeNode root) {
         printTree(root, null, false);
     }
 
-    /**
-     * Print a binary tree
-     * @param root
-     * @param prev
-     * @param isLeft
-     */
+    /* Print a binary tree */
     public static void printTree(TreeNode root, Trunk prev, boolean isLeft) {
         if (root == null) {
             return;
@@ -107,10 +89,7 @@ public class PrintUtil {
         printTree(root.left, trunk, false);
     }
 
-    /**
-     * Helper function to print branches of the binary tree
-     * @param p
-     */
+    /* Helper function to print branches of the binary tree */
     public static void showTrunks(Trunk p) {
         if (p == null) {
             return;
@@ -120,22 +99,14 @@ public class PrintUtil {
         System.out.print(p.str);
     }
 
-    /**
-     * Print a hash map
-     * @param <K>
-     * @param <V>
-     * @param map
-     */
+    /* Print a hash map */
     public static <K, V> void printHashMap(Map<K, V> map) {
-        for (Map.Entry <K, V> kv: map.entrySet()) {
+        for (Map.Entry<K, V> kv : map.entrySet()) {
             System.out.println(kv.getKey() + " -> " + kv.getValue());
         }
     }
 
-    /**
-     * Print a heap (PriorityQueue)
-     * @param queue
-     */
+    /* Print a heap (PriorityQueue) */
     public static void printHeap(Queue<Integer> queue) {
         List<Integer> list = new ArrayList<>(queue);
         System.out.print("堆的数组表示：");

codes/java/include/TreeNode.java

@@ -8,40 +8,36 @@ package include;
 
 import java.util.*;
 
-/**
- * Definition for a binary tree node.
- */
+/* Definition for a binary tree node. */
 public class TreeNode {
-    public int val;        // 节点值
-    public int height;     // 节点高度
-    public TreeNode left;  // 左子节点引用
+    public int val; // 节点值
+    public int height; // 节点高度
+    public TreeNode left; // 左子节点引用
     public TreeNode right; // 右子节点引用
 
     public TreeNode(int x) {
         val = x;
     }
 
-    /**
-     * Generate a binary tree given an array
-     * @param list
-     * @return
-     */
+    /* Generate a binary tree given an array */
     public static TreeNode listToTree(List<Integer> list) {
         int size = list.size();
         if (size == 0)
             return null;
-        
+
         TreeNode root = new TreeNode(list.get(0));
         Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
         int i = 0;
-        while(!queue.isEmpty()) {
+        while (!queue.isEmpty()) {
             TreeNode node = queue.poll();
-            if (++i >= size) break;
+            if (++i >= size)
+                break;
             if (list.get(i) != null) {
                 node.left = new TreeNode(list.get(i));
                 queue.add(node.left);
             }
-            if (++i >= size) break;
+            if (++i >= size)
+                break;
             if (list.get(i) != null) {
                 node.right = new TreeNode(list.get(i));
                 queue.add(node.right);
@@ -50,23 +46,19 @@ public class TreeNode {
         return root;
     }
 
-    /**
-     * Serialize a binary tree to a list
-     * @param root
-     * @return
-     */
+    /* Serialize a binary tree to a list */
     public static List<Integer> treeToList(TreeNode root) {
         List<Integer> list = new ArrayList<>();
-        if(root == null) return list;
+        if (root == null)
+            return list;
         Queue<TreeNode> queue = new LinkedList<>() {{ add(root); }};
-        while(!queue.isEmpty()) {
+        while (!queue.isEmpty()) {
             TreeNode node = queue.poll();
-            if(node != null) {
+            if (node != null) {
                 list.add(node.val);
                 queue.add(node.left);
                 queue.add(node.right);
-            }
-            else {
+            } else {
                 list.add(null);
             }
         }

codes/java/include/Vertex.java

@@ -11,6 +11,7 @@ import java.util.*;
 /* 顶点类 */
 public class Vertex {
     public int val;
+
     public Vertex(int val) {
         this.val = val;
     }
@@ -32,4 +33,4 @@ public class Vertex {
         }
         return vals;
     }
-}
+}