refactor for format

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_390.java

@@ -36,8 +36,11 @@ public int lastRemaining(int n) {
         boolean forward = true;
         while (remaining > 1) {
             remaining /= 2;
-            if (forward) start = start + step * remaining - step / 2;
-            else start = start - step * remaining + step / 2;
+            if (forward) {
+                start = start + step * remaining - step / 2;
+            } else {
+                start = start - step * remaining + step / 2;
+            }
             step *= 2;
             forward = !forward;
         }
@@ -53,15 +56,21 @@ public static int lastRemaining_brute_force_TLE(int n) {
         boolean forward = true;
         while (list.size() > 1) {
             int size = list.size() / 2;
-            if (list.size() == 1) return list.get(0);
+            if (list.size() == 1) {
+                return list.get(0);
+            }
             if (forward) {
-                if (list.size() == 1) return list.get(0);
+                if (list.size() == 1) {
+                    return list.get(0);
+                }
                 for (int i = 0; i <= size && i < list.size(); i++) {
                     list.remove(i);
                 }
                 forward = false;
             } else {
-                if (list.size() == 1) return list.get(0);
+                if (list.size() == 1) {
+                    return list.get(0);
+                }
                 for (int i = list.size() - 1, count = 0; i >= 0 && count <= size; count++) {
                     list.remove(i);
                     i -= 2;

src/main/java/com/fishercoder/solutions/_393.java

@@ -43,13 +43,21 @@ public boolean validUtf8(int[] data) {
         int count = 0;
         for (int d : data) {
             if (count == 0) {
-                if ((d >> 5) == 0b110) count = 1;
-                else if ((d >> 4) == 0b1110) count = 2;
-                else if ((d >> 3) == 0b11110) count = 3;
-                else if ((d >> 7) == 1) return false;
+                if ((d >> 5) == 0b110) {
+                    count = 1;
+                } else if ((d >> 4) == 0b1110) {
+                    count = 2;
+                } else if ((d >> 3) == 0b11110) {
+                    count = 3;
+                } else if ((d >> 7) == 1) {
+                    return false;
+                }
             } else {
-                if ((d >> 6) != 0b10) return false;
-                else count--;
+                if ((d >> 6) != 0b10) {
+                    return false;
+                } else {
+                    count--;
+                }
             }
         }
         return count == 0;

src/main/java/com/fishercoder/solutions/_398.java

@@ -40,7 +40,9 @@ public int pick(int target) {
                     list.add(i);
                 }
             }
-            if (list.size() == 1) return list.get(0);
+            if (list.size() == 1) {
+                return list.get(0);
+            }
             int randomIndex = rand.nextInt(list.size());
             return list.get(randomIndex);
         }
@@ -68,7 +70,9 @@ public SolutionMemoryLimitExceeded(int[] nums) {
 
         public int pick(int target) {
             List<Integer> list = map.get(target);
-            if (list.size() == 1) return list.get(0);
+            if (list.size() == 1) {
+                return list.get(0);
+            }
             int randomIndex = rand.nextInt(list.size());
             return list.get(randomIndex);
         }

src/main/java/com/fishercoder/solutions/_399.java

@@ -56,23 +56,33 @@ public double[] calcEquation(String[][] equations, double[] values, String[][] q
         for (int i = 0; i < queries.length; i++) {
             String[] query = queries[i];
             result[i] = dfs(query[0], query[1], pairs, valuePairs, new HashSet<>(), 1.0);
-            if (result[i] == 0.0) result[i] = -1.0;
+            if (result[i] == 0.0) {
+                result[i] = -1.0;
+            }
         }
         return result;
     }
 
     private double dfs(String start, String end, Map<String, List<String>> pairs, Map<String, List<Double>> valuePairs, HashSet<String> set, double value) {
-        if (set.contains(start)) return 0.0;
-        if (!pairs.containsKey(start)) return 0.0;
-        if (start.equals(end)) return value;
+        if (set.contains(start)) {
+            return 0.0;
+        }
+        if (!pairs.containsKey(start)) {
+            return 0.0;
+        }
+        if (start.equals(end)) {
+            return value;
+        }
         set.add(start);
 
         List<String> stringList = pairs.get(start);
         List<Double> valueList = valuePairs.get(start);
         double tmp = 0.0;
         for (int i = 0; i < stringList.size(); i++) {
             tmp = dfs(stringList.get(i), end, pairs, valuePairs, set, value * valueList.get(i));
-            if (tmp != 0.0) break;
+            if (tmp != 0.0) {
+                break;
+            }
         }
         set.remove(start);
         return tmp;