import java.util.Arrays;
public class Main {
public static void main(String[] args) {
int[] numbers = {1, 2, 3, 4, 5};
reverse(numbers);
/*
output is:
Array = [1, 2, 3, 4, 5]
Reversed array = [5, 4, 3, 2, 1]
*/
}
public static void reverse(int[] array) {
System.out.println("Array = " + Arrays.toString(array));
int maxIndex = array.length - 1;
int halfLength = array.length / 2;
for (int i = 0; i < halfLength; i++) {
int temp = array[i];
array[i] = array[maxIndex - i];
array[maxIndex - i] = temp;
}
System.out.println("Reversed array = " + Arrays.toString(array));
}
}
//With Commons.Lang, you could simply use
ArrayUtils.reverse(int[] array)
// For reversing subarray
ArrayUtils.reverse(int[] array,int startIndexInclusive, int endIndexExclusive)
import java.util.*;
import java.util.stream.Collectors;
int[] array = new int[] {23, 54, 12};
List<Integer> list = Arrays.stream(array).boxed().collect(Collectors.toList());
Collections.reverse(list);
array = list.stream().mapToInt(x -> x).toArray();
//array = [12,54,23]
public void reverseArray(int[] arr) {
int len = arr.length;
int left = 0, right = len - 1 - left;
while (left < right) {
swap(arr, left, right);
left++;
right--;
}
}
private void swap(int[] arr, int left, int right) {
int tmp = =arr[left];
arr[left] = arr[right];
arr[right] = tmp;
}
int[] xr = {1, 2, 3, 4, 5};
System.out.print("[");
for (int i = xr.length - 1; i >= 0; i--) {
System.out.print(xr[i] + ", ");
}
System.out.println("]");
}
// Algorithm
wide_floating_point e() {
unsigned n = 33;
my_uint128 num = 1;
my_uint128 den = 1;
for (unsigned i=1; i <= n; i++) {
num = num*i + 1;
den = den*i;
}
return (wide_floating_point) num/fact;
}
WWWWW-
S---W-
W-W-W-
W-W---
E-W-W-
WWWWW-