From 26e7b7f1ef08882076168665469f427de3dff6e8 Mon Sep 17 00:00:00 2001 From: Lena Date: Thu, 21 Apr 2022 14:30:22 +0200 Subject: [PATCH] =?UTF-8?q?Datei=20verschoben,=20Methode=20erg=C3=A4nzt?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ArrayManipulation.java | 22 ---------------------- HA1/ArrayManipulation.java | 34 ++++++++++++++++++++++++++++++++++ 2 files changed, 34 insertions(+), 22 deletions(-) delete mode 100644 ArrayManipulation.java create mode 100644 HA1/ArrayManipulation.java diff --git a/ArrayManipulation.java b/ArrayManipulation.java deleted file mode 100644 index 22b6ed2..0000000 --- a/ArrayManipulation.java +++ /dev/null @@ -1,22 +0,0 @@ -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))); - - } -} diff --git a/HA1/ArrayManipulation.java b/HA1/ArrayManipulation.java new file mode 100644 index 0000000..cb95d7b --- /dev/null +++ b/HA1/ArrayManipulation.java @@ -0,0 +1,34 @@ +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[] removeLast(int[] arr){ + int arr2[]; + if(arr.length<=1) return arr2 = new int[0]; //Falls Array nur eine oder weniger Elemente hat,leeres Array zurückgeben + arr2 = new int[arr.length-1]; //Sonst neues Array mit einem Element weniger erstellen + for(int i=0; i