format code

realDuYuanChao · realDuYuanChao · commit cd3dfe6a5be5 · 2020-12-27T20:22:04.000+08:00
diff --git a/ProjectEuler/Problem03.java b/ProjectEuler/Problem03.java
@@ -8,48 +8,47 @@
  * <p>Link: https://projecteuler.net/problem=3
  */
 public class Problem03 {
-    /**
-     * Check if a given number is prime
-     *
-     * @param n integer number
-     * @return true if n is prime, false otherwise
-     */
-    static boolean isPrime(int n) {
-        for (int i = 2; i <= Math.sqrt(n); i++) {
-            if (n % i == 0)
-                return false;
-        }
-        return true;
+  /**
+   * Check if a given number is prime
+   *
+   * @param n integer number
+   * @return true if n is prime, false otherwise
+   */
+  static boolean isPrime(int n) {
+    for (int i = 2; i <= Math.sqrt(n); i++) {
+      if (n % i == 0) return false;
     }
+    return true;
+  }
 
-    /**
-     * Calculate all the prime factors of a number and return the largest
-     *
-     * @param n integer number
-     * @return the maximum prime factor of the given number
-     */
-    static long maxPrimeFactor(long n) {
-        for (int i = 2; i < n / 2; i++) {
-            if (isPrime(i))
-                while (n % i == 0) {
-                    n /= i;
-                }
+  /**
+   * Calculate all the prime factors of a number and return the largest
+   *
+   * @param n integer number
+   * @return the maximum prime factor of the given number
+   */
+  static long maxPrimeFactor(long n) {
+    for (int i = 2; i < n / 2; i++) {
+      if (isPrime(i))
+        while (n % i == 0) {
+          n /= i;
         }
-        return n;
     }
+    return n;
+  }
 
-    public static void main(String[] args) {
-        long c = 600851475143L;
-        int[][] testNumbers = {
-                {87, 29},
-                {10, 5},
-                {21, 7},
-                {657, 73},
-                {777, 37}
-        };
-        for (int[] num : testNumbers) {
-            assert Problem03.maxPrimeFactor(num[0]) == num[1];
-        }
-        assert Problem03.maxPrimeFactor(c) == 6857;
+  public static void main(String[] args) {
+    long c = 600851475143L;
+    int[][] testNumbers = {
+      {87, 29},
+      {10, 5},
+      {21, 7},
+      {657, 73},
+      {777, 37}
+    };
+    for (int[] num : testNumbers) {
+      assert Problem03.maxPrimeFactor(num[0]) == num[1];
     }
+    assert Problem03.maxPrimeFactor(c) == 6857;
+  }
 }
