Add tests for Problem 1, 2 and 3

Author: blacklp

pom.xml

@@ -8,5 +8,16 @@
     <artifactId>project-euler-java</artifactId>
     <version>1.0-SNAPSHOT</version>
 
-
+    <dependencies>
+        <dependency>
+            <groupId>junit</groupId>
+            <artifactId>junit</artifactId>
+            <version>4.12</version>
+        </dependency>
+        <dependency>
+            <groupId>org.assertj</groupId>
+            <artifactId>assertj-core</artifactId>
+            <version>3.6.2</version>
+        </dependency>
+    </dependencies>
 </project>

src/main/java/Problem1.java

@@ -5,14 +5,19 @@
  * Find the sum of all the multiples of 3 or 5 below 1000.
  */
 public class Problem1 {
-    public static void main(String[] args) {
+    public int solve() {
         int result = 0;
 
         for (int i = 3; i < 1000; i++) {
             if (i % 3 == 0 || i % 5 == 0) {
                 result += i;
             }
         }
+        return result;
+    }
+
+    public static void main(String[] args) {
+        int result = new Problem1().solve();
         System.out.println("Result: " + result);
     }
 }

src/main/java/Problem2.java

@@ -7,7 +7,7 @@
  * By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
  */
 public class Problem2 {
-    public static void main(String[] args) {
+    public int solve() {
         int previous = 1;
         int current = 1;
         int result = 0;
@@ -20,6 +20,11 @@ public static void main(String[] args) {
             previous = current;
             current = newCurrent;
         }
+        return result;
+    }
+
+    public static void main(String[] args) {
+        int result = new Problem2().solve();
         System.out.println("Result: " + result);
     }
 }

src/main/java/Problem3.java

@@ -5,11 +5,11 @@
  * What is the largest prime factor of the number 600851475143 ?
  */
 public class Problem3 {
-    public static void main(String[] args) {
+    public int solve() {
         long num = 600851475143L;
-        long largest = -1;
+        int largest = -1;
         long copy = num;
-        for (long i = 2; i < Math.sqrt(num); i++) {
+        for (int i = 2; i < Math.sqrt(num); i++) {
             if (copy == 1L) {
                 break;
             }
@@ -18,6 +18,11 @@ public static void main(String[] args) {
                 largest = i;
             }
         }
-        System.out.println("Result: " + largest);
+        return largest;
+    }
+
+    public static void main(String[] args) {
+        int result = new Problem3().solve();
+        System.out.println("Result: " + result);
     }
 }

src/test/java/Problem1Test.java

@@ -0,0 +1,10 @@
+import org.assertj.core.api.Assertions;
+import org.junit.Test;
+
+public class Problem1Test {
+    @Test
+    public void checkValidValue() {
+        int result = new Problem1().solve();
+        Assertions.assertThat(result).isEqualTo(233168);
+    }
+}

src/test/java/Problem2Test.java

@@ -0,0 +1,10 @@
+import org.assertj.core.api.Assertions;
+import org.junit.Test;
+
+public class Problem2Test {
+    @Test
+    public void checkValidValue() {
+        int result = new Problem2().solve();
+        Assertions.assertThat(result).isEqualTo(4613732);
+    }
+}

src/test/java/Problem3Test.java

@@ -0,0 +1,10 @@
+import org.assertj.core.api.Assertions;
+import org.junit.Test;
+
+public class Problem3Test {
+    @Test
+    public void checkValidValue() {
+        int result = new Problem3().solve();
+        Assertions.assertThat(result).isEqualTo(6857);
+    }
+}