Dominique
3 years ago
1 changed files with 48 additions and 22 deletions
@ -1,22 +1,48 @@ |
|||
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))); |
|||
|
|||
} |
|||
} |
|||
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) { |
|||
int[] help = new int[arr.length - 1]; |
|||
for(int i=1; i < arr.length; i++){ //nico.schroeder@informatik.hs-fulda.de |
|||
help[i-1] = arr[i]; |
|||
|
|||
} |
|||
return help; |
|||
} |
|||
|
|||
|
|||
public static int[] removeLast(int[] arr){ |
|||
int[] help = new int[arr.length-1]; |
|||
for(int i=0; i<arr.length-1; i++){ |
|||
help[i]=arr[i]; |
|||
} |
|||
return help; |
|||
} |
|||
public static int[] squareEach(int[] arr){ |
|||
int[] square= new int[arr.length]; |
|||
for(int i= 0; i<arr.length; i++){ |
|||
square[i] = arr[i]*arr[i]; |
|||
} |
|||
return square; |
|||
} |
|||
public static void main(String[] args) { |
|||
|
|||
int[] arr = {1,2,3,4,5}; |
|||
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))); |
|||
} |
|||
} |
Write
Preview
Loading…
Cancel
Save
Reference in new issue