Browse Source
created HA01 Folder and moved ArrayManipulation.java into it to keep new Projects clean
master
created HA01 Folder and moved ArrayManipulation.java into it to keep new Projects clean
master
3 changed files with 52 additions and 53 deletions
@ -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))); |
|||
} |
|||
} |
@ -1 +0,0 @@ |
|||
TEST |
Write
Preview
Loading…
Cancel
Save
Reference in new issue