From 866c2c5ecb35b1fdeace67c4ed99f4bf3a278186 Mon Sep 17 00:00:00 2001
From: Emma Nagelschmidt <n-eln@live.de>
Date: Wed, 20 Apr 2022 22:32:09 +0200
Subject: [PATCH 1/3] Unser erster Commit!

---
 ArrayManipulation.java | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 ArrayManipulation.java

diff --git a/ArrayManipulation.java b/ArrayManipulation.java
new file mode 100644
index 0000000..22b6ed2
--- /dev/null
+++ b/ArrayManipulation.java
@@ -0,0 +1,22 @@
+import java.util.Arrays;
+
+public class ArrayManipulation {
+
+   
+    public static int[] reverseArray(int[] arr) {
+
+        for (int i = 0; i < arr.length/2; i++) {
+            int tmp = arr[i];
+            arr[i] = arr[arr.length - 1 - i];
+            arr[arr.length - 1 - i] = tmp;
+         }
+         return arr;
+
+    }
+    public static void main(String[] args) {
+       
+        int[] arr = {1,2,3,4,5};
+        System.out.println(Arrays.toString(reverseArray(arr)));
+        
+    }
+}

From 3143da50961b2318c919da167fa61d39e4830f87 Mon Sep 17 00:00:00 2001
From: Emma Nagelschmidt <n-eln@live.de>
Date: Wed, 20 Apr 2022 22:56:29 +0200
Subject: [PATCH 2/3] Unser zweiter Commit!

---
 ArrayManipulation.java | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/ArrayManipulation.java b/ArrayManipulation.java
index 22b6ed2..dac87f2 100644
--- a/ArrayManipulation.java
+++ b/ArrayManipulation.java
@@ -13,6 +13,10 @@ public class ArrayManipulation {
          return arr;
 
     }
+    public static int[] removeFirst(int[] arr) {
+        int[] result = new int[3];
+        return int[] result = Arrays.copyOfRange(arr, 1);
+    }
     public static void main(String[] args) {
        
         int[] arr = {1,2,3,4,5};

From efed7ff296cd9ea6b626c6527d5a363be3f503d2 Mon Sep 17 00:00:00 2001
From: fdai7303 <leonhard-tristan.beermann1@informatik.hs-fulda.de>
Date: Fri, 22 Apr 2022 12:10:05 +0200
Subject: [PATCH 3/3] =?UTF-8?q?Dateien=20hochladen=20nach=20=E2=80=9E?=
 =?UTF-8?q?=E2=80=9C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Meine Lösung der 3 zusatz Methoden
---
 ArrayManipulation_L.java | 52 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 ArrayManipulation_L.java

diff --git a/ArrayManipulation_L.java b/ArrayManipulation_L.java
new file mode 100644
index 0000000..745499b
--- /dev/null
+++ b/ArrayManipulation_L.java
@@ -0,0 +1,52 @@
+import java.util.Arrays;
+
+public class ArrayManipulation {
+
+   
+    public static int[] reverseArray(int[] arr) {
+
+        for (int i = 0; i < arr.length/2; i++) {
+            int tmp = arr[i];
+            arr[i] = arr[arr.length - 1 - i];
+            arr[arr.length - 1 - i] = tmp;
+         }
+         return arr;
+    }
+
+    public static int[] removeFirst(int[] arr) {
+        //temp array erstellen, mit einer stelle weniger
+        int[] temp = new int[arr.length - 1];
+        //Zahlen Rüberkopieren, bis auf die erste
+        for (int i = 1, k = 0; i < arr.length; i++) {
+            temp[k++] = arr[i];
+        }
+        return temp;
+    }
+
+    public static int[] removeLast(int[] arr) {
+        //temp array erstellen, mit einer stelle weniger
+        int[] temp = new int[arr.length - 1];
+        //Zahlen Rüberkopieren, bis auf das letzte
+        for (int i = 0, k = 0; i < temp.length; i++) {
+            temp[k++] = arr[i];
+        }
+        return temp;
+    }
+
+    public static int[] squareEach(int[] arr) {
+        for (int i = 0; i < arr.length; i++) {
+            int tmp = arr[i];
+            arr[i] = tmp*tmp;
+         }
+         return arr;
+    }
+    public static void main(String[] args) {
+       
+        int[] arr = {1,2,3,4,5};
+        System.out.println(Arrays.toString(arr));
+        System.out.println(Arrays.toString(reverseArray(arr)));
+        System.out.println(Arrays.toString(squareEach(arr)));
+        System.out.println(Arrays.toString(removeFirst(arr)));
+        System.out.println(Arrays.toString(removeLast(arr)));
+    }
+}