fixed minor bug in prime testing java function

java/append_primes/Main.java

@@ -6,14 +6,8 @@ public class Main
     {
         Util.init();
 
-        ArrayList<Long> vals = new ArrayList<Long>();
+        Tree tree = new Tree(0, new ArrayList<Long>());
-        vals.add(2l);
+        for (int i = 0; i < 9; i++) {
-        vals.add(3l);
-        vals.add(5l);
-        vals.add(7l);
-
-        Tree tree = new Tree(0, vals);
-        for (int i = 0; i < 20; i++) {
             tree.step();
             Util.printList(tree.longestPath());
         }

java/append_primes/Util.java

@@ -17,6 +17,10 @@ class Util
         if (primes.containsKey(val)) {
             return primes.get(val);
         }
+        if (val < 2) {
+            primes.put(val, false);
+            return false;
+        }
         for (int i = 2; i * i <= val; i++) {
             if (val % i == 0) {
                 primes.put(val, false);

java/template/Util.java

@@ -21,6 +21,10 @@ class Util
         if (primes.containsKey(val)) {
             return primes.get(val);
         }
+        if (val < 2) {
+            primes.put(val, false);
+            return false;
+        }
         for (int i = 2; i * i <= val; i++) {
             if (val % i == 0) {
                 primes.put(val, false);