feat:format code

Author: zhujinming

solution/0500-0599/0500.Keyboard Row/Solution.java

@@ -1,17 +1,21 @@
+import java.util.ArrayList;
+
+public class Solution {
+
     public String[] findWords(String[] words) {
-        if(words == null){
+        if (words == null) {
             return null;
         }
         ArrayList<String> list = new ArrayList<>();
-        String[] keyboards = {"qwertyuiop","asdfghjkl","zxcvbnm"};
+        String[] keyboards = {"qwertyuiop", "asdfghjkl", "zxcvbnm"};
         for (int i = 0; i < words.length; i++) {
             String word = words[i].toLowerCase();
-            for (int j = 0; j <  keyboards.length; j++) {
+            for (int j = 0; j < keyboards.length; j++) {
                 // 先用word首字符确定属于哪一行
-                if(keyboards[j].indexOf(word.charAt(0))>-1){
+                if (keyboards[j].indexOf(word.charAt(0)) > -1) {
                     // 判断word字符串所有字符是否都属于同一行
-                    boolean match = match(keyboards[j], word,list);
-                    if(match){
+                    boolean match = match(keyboards[j], word, list);
+                    if (match) {
                         list.add(words[i]);
                     }
                     break;
@@ -22,10 +26,11 @@ public String[] findWords(String[] words) {
     }
 
     private boolean match(String keyboard, String word, ArrayList<String> list) {
-        for (int i = 1; i <word.length() ; i++) {
-            if(keyboard.indexOf(word.charAt(i))<0){
+        for (int i = 1; i < word.length(); i++) {
+            if (keyboard.indexOf(word.charAt(i)) < 0) {
                 return false;
             }
         }
-        return  true;
-    }
+        return true;
+    }
+}

solution/0500-0599/0501.Find Mode in Binary Search Tree/Solution.java

@@ -1,33 +1,40 @@
-    int max=0;
-    int cur=0;
-    TreeNode preNode = null ;
+import java.util.List;
+import java.util.ArrayList;
+
+public class Solution {
+
+    int max = 0;
+    int cur = 0;
+    TreeNode preNode = null;
+
     public int[] findMode(TreeNode root) {
         ArrayList<Integer> list = new ArrayList<>();
         findMode(root, list);
         int[] res = new int[list.size()];
-        for (int i = 0;i<list.size();i++){
+        for (int i = 0; i < list.size(); i++) {
             res[i] = list.get(i);
         }
         return res;
     }
 
     private void findMode(TreeNode root, ArrayList<Integer> list) {
-        if(root == null){
+        if (root == null) {
             return;
         }
         findMode(root.left, list);
-        if(preNode!=null && root.val == preNode.val ){
+        if (preNode != null && root.val == preNode.val) {
             cur++;
         } else {
             cur = 1;
         }
-        if(max < cur ){
+        if (max < cur) {
             max = cur;
             list.clear();
             list.add(root.val);
-        }else if(max == cur) {
+        } else if (max == cur) {
             list.add(root.val);
         }
         preNode = root;
         findMode(root.right, list);
     }
+}