add UE09_Rekursion2

src/UE09_191124_Rekursion2/UE09_Rekursion2.java

@@ -0,0 +1,57 @@
+package UE09_191124_Rekursion2;
+
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.ArrayList;
+import java.util.List;
+
+public class UE09_Rekursion2 {
+    public static void main(String[] args) {
+//        int[][] file1 = readFile("src/UE09_191124_Rekursion2/UE09_triangle1.txt");
+//        int[][] file2 = readFile("src/UE09_191124_Rekursion2/UE09_triangle2.txt");
+//        int[][] file3 = readFile("src/UE09_191124_Rekursion2/UE09_triangle.txt");
+//        System.out.println("\n" + maxTotalRekursion(file1, 0, 0));
+//        System.out.println("\n" + maxTotalRekursion(file2, 0, 0));
+//        System.out.println("\n" + maxTotalRekursion(file3, 0, 0)); //Braucht ewig lange, da File sehr groß
+        System.out.println(collatz());
+    }
+
+    public static int[][] readFile(String file) {
+        try {
+            List<String> lines = Files.readAllLines(Path.of(file));
+            int[][] output = new int[lines.size()][];
+            for (int i = 0; i < output.length; i++) {
+                String[] line = lines.get(i).trim().split(" ");
+                output[i] = new int[line.length];
+                for (int j = 0; j < line.length; j++) output[i][j] = Integer.parseInt(line[j]);
+            }
+            return output;
+        } catch (IOException e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public static long maxTotalRekursion(int[][] input, int x, int y) {
+        return (x >= input.length - 1) ? input[x][y] : Long.max(maxTotalRekursion(input, x + 1, y), maxTotalRekursion(input, x + 1, y + 1)) + input[x][y];
+    }
+
+    public static long collatz() {
+        long startingNumber = 0, maxLength = 0;
+        for (int i = 1; i < 1000000; i++) {
+            long length = longestCollatzSequence(new ArrayList<>(), i).size();
+            if (length > maxLength) {
+                maxLength = length;
+                startingNumber = i;
+            }
+        }
+        return startingNumber;
+    }
+
+    public static List<Long> longestCollatzSequence(List<Long> l, long n) {
+        if (n == 1) return l;
+        l.add(n);
+        n = ((n & 1) == 0) ? (n / 2) : (3 * n + 1);
+        return longestCollatzSequence(l, n);
+    }
+}

src/UE09_191124_Rekursion2/UE09_triangle1.txt

@@ -0,0 +1,4 @@
+3
+7 4
+2 4 6
+8 5 9 3

src/UE09_191124_Rekursion2/UE09_triangle2.txt

@@ -0,0 +1,15 @@
+75
+95 64
+17 47 82
+18 35 87 10
+20 04 82 47 65
+19 01 23 75 03 34
+88 02 77 73 07 63 67
+99 65 04 28 06 16 70 92
+41 41 26 56 83 40 80 70 33
+41 48 72 33 47 32 37 16 94 29
+53 71 44 65 25 43 91 52 97 51 14
+70 11 33 28 77 73 17 78 39 68 17 57
+91 71 52 38 17 14 91 43 58 50 27 29 48
+63 66 04 68 89 53 67 30 73 16 69 87 40 31
+04 62 98 27 23 09 70 98 73 93 38 53 60 04 23