[REFACTOR] checkstyle fixes.

Author: Gonzalo Diaz

algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java

@@ -41,8 +41,8 @@ public static Long euler001(Integer a, Integer b, Integer n) {
     Long lcm = (a * b) / gcd(a, b);
 
     result = sumOfArithmeticProgression((long) n, (long) a)
-      + sumOfArithmeticProgression((long) n, (long) b)
-      - sumOfArithmeticProgression((long) n, lcm);
+        + sumOfArithmeticProgression((long) n, (long) b)
+        - sumOfArithmeticProgression((long) n, lcm);
 
     String log = String.format("Problem 001 solved: %d", result);
     Log.info(log);

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0021.java

@@ -47,7 +47,7 @@ public static String problem0021(int start, int limit) {
 
       if (
           !key.equals(value)
-          && key.equals(properDivisorsSums.get(value))
+            && key.equals(properDivisorsSums.get(value))
       ) {
         amicableNumbers.add(key);
       }