Fixed style

Author: javadev

src/main/java/g3201_3300/s3260_find_the_largest_palindrome_divisible_by_k/Solution.java

@@ -38,7 +38,9 @@ public String largestPalindrome(int n, int k) {
             sc[n - 1] = '5';
         } else if (k == 6) {
             String number = getString(n, sc);
-            if (number != null) return number;
+            if (number != null) {
+                return number;
+            }
         } else if (k == 8) {
             Arrays.fill(sc, '8');
             int i = 3;