From 873c0e4537da5879cd5141d81bc41004636c1cfa Mon Sep 17 00:00:00 2001
From: AlexBa16 <139718933+AlexBa16@users.noreply.github.com>
Date: Fri, 29 Nov 2024 13:57:35 +0100
Subject: [PATCH] add UE09_Rekursion2

---
 .idea/inspectionProfiles/Project_Default.xml  |  2 +-
 .../UE09_Rekursion2.java                      | 24 +++++++++++--------
 2 files changed, 15 insertions(+), 11 deletions(-)

diff --git a/.idea/inspectionProfiles/Project_Default.xml b/.idea/inspectionProfiles/Project_Default.xml
index 3266772..52733d2 100644
--- a/.idea/inspectionProfiles/Project_Default.xml
+++ b/.idea/inspectionProfiles/Project_Default.xml
@@ -2,7 +2,7 @@
   <profile version="1.0">
     <option name="myName" value="Project Default" />
     <inspection_tool class="CommentedOutCode" enabled="true" level="WEAK WARNING" enabled_by_default="true">
-      <option name="minLines" value="7" />
+      <option name="minLines" value="10" />
     </inspection_tool>
     <inspection_tool class="RegExpAnonymousGroup" enabled="true" level="WARNING" enabled_by_default="true" />
     <inspection_tool class="RegExpEscapedMetaCharacter" enabled="false" level="INFORMATION" enabled_by_default="false" />
diff --git a/src/UE09_191124_Rekursion2/UE09_Rekursion2.java b/src/UE09_191124_Rekursion2/UE09_Rekursion2.java
index 3ea016f..a519685 100644
--- a/src/UE09_191124_Rekursion2/UE09_Rekursion2.java
+++ b/src/UE09_191124_Rekursion2/UE09_Rekursion2.java
@@ -3,7 +3,6 @@ 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 {
@@ -14,7 +13,10 @@ public class UE09_Rekursion2 {
 //        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());
+//        System.out.println(longestCollatzSequence(999999));
+//        System.out.println(longestCollatzSequence(13));
+//        System.out.println(collatzSequenceLength(13));
+        System.out.println(coinSums(2));
     }
 
     public static int[][] readFile(String file) {
@@ -36,10 +38,10 @@ public class UE09_Rekursion2 {
         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() {
+    public static long longestCollatzSequence(int limit) {
         long startingNumber = 0, maxLength = 0;
-        for (int i = 1; i < 1000000; i++) {
-            long length = longestCollatzSequence(new ArrayList<>(), i).size();
+        for (int i = 1; i <= limit; i++) {
+            long length = collatzSequenceLength(i);
             if (length > maxLength) {
                 maxLength = length;
                 startingNumber = i;
@@ -48,10 +50,12 @@ public class UE09_Rekursion2 {
         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);
+    public static long collatzSequenceLength(long n) {
+        return n == 1 ? 1 : collatzSequenceLength((n & 1) == 0 ? n / 2 : 3 * n + 1) + 1;
+    }
+
+    public static long coinSums(int coin) {
+        
+        return 0;
     }
 }