Alexander Guenzel
3 years ago
commit
f8d90897f1
1 changed files with 70 additions and 0 deletions
@ -0,0 +1,70 @@ |
|||
package bonusquiz; |
|||
|
|||
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; |
|||
} |
|||
|
|||
/*Liefert ein neues Array zurück ohne das erste Element*/ |
|||
public static int[] removeFirst(int[] arr) { |
|||
|
|||
int [] arrNeu = {}; |
|||
if(arr.length != 0) { |
|||
arrNeu = new int[arr.length-1]; |
|||
for (int i = 1; i < arr.length; i++) { |
|||
arrNeu[i-1] = arr[i]; |
|||
} |
|||
} |
|||
return arrNeu; |
|||
|
|||
} |
|||
/*Erstellt ein neues Array ohne das letzte Element*/ |
|||
public static int[] removeLast(int[] arr) { |
|||
|
|||
int [] arrNeu = {}; |
|||
arrNeu = new int[arr.length-1]; |
|||
if(arr.length != 0) { |
|||
for (int i =0; i < arr.length -1; i++) { |
|||
arrNeu[i] = arr[i]; |
|||
} |
|||
} |
|||
|
|||
return arrNeu; |
|||
|
|||
} |
|||
|
|||
/*Erstellt ein neues Array wo alle Zahlen quadriert werden*/ |
|||
|
|||
public static int[] squareEach(int[] arr) { |
|||
|
|||
int [] arrNeu = {}; |
|||
arrNeu = new int[arr.length]; |
|||
for (int i=0; i <arr.length; i++) { |
|||
arrNeu[i] = arr[i] * arr[i]; |
|||
} |
|||
return arrNeu; |
|||
|
|||
} |
|||
|
|||
|
|||
|
|||
public static void main(String[] args) { |
|||
|
|||
int[] arr = {1,2,3,4,5}; |
|||
int [] arr2 = {}; |
|||
System.out.println(Arrays.toString(reverseArray(arr))); |
|||
System.out.println(Arrays.toString(removeFirst(arr))); |
|||
System.out.println(Arrays.toString(removeLast(arr))); |
|||
System.out.println(Arrays.toString(squareEach(arr))); |
|||
} |
|||
} |
Write
Preview
Loading…
Cancel
Save
Reference in new issue