From 746eb987fe449ac4c89976dd6abab32c7d75c254 Mon Sep 17 00:00:00 2001 From: fdai7303 Date: Thu, 28 Apr 2022 07:54:54 +0200 Subject: [PATCH] created HA01 Folder and moved ArrayManipulation.java into it to keep new Projects clean --- .../ArrayManipulation.java | 0 .../ArrayManipulation_L.java | 104 +++++++++--------- TEST.txt | 1 - 3 files changed, 52 insertions(+), 53 deletions(-) rename ArrayManipulation.java => HA01/ArrayManipulation.java (100%) rename ArrayManipulation_L.java => HA01/ArrayManipulation_L.java (96%) delete mode 100644 TEST.txt diff --git a/ArrayManipulation.java b/HA01/ArrayManipulation.java similarity index 100% rename from ArrayManipulation.java rename to HA01/ArrayManipulation.java diff --git a/ArrayManipulation_L.java b/HA01/ArrayManipulation_L.java similarity index 96% rename from ArrayManipulation_L.java rename to HA01/ArrayManipulation_L.java index 745499b..acc78ea 100644 --- a/ArrayManipulation_L.java +++ b/HA01/ArrayManipulation_L.java @@ -1,52 +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))); - } -} +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))); + } +} diff --git a/TEST.txt b/TEST.txt deleted file mode 100644 index 3b12464..0000000 --- a/TEST.txt +++ /dev/null @@ -1 +0,0 @@ -TEST \ No newline at end of file