Reverse an Array
Reverse the order of elements in an array.
Sample input
[1, 2, 3, 4, 5]
Sample output
5 4 3 2 1
Solution
arr = [1, 2, 3, 4, 5]
arr.reverse()
print(*arr)
const arr = [1, 2, 3, 4, 5];
arr.reverse();
console.log(arr.join(" "));
public class Main {
public static void main(String[] args) {
int[] arr = {1, 2, 3, 4, 5};
StringBuilder sb = new StringBuilder();
for (int i = arr.length - 1; i >= 0; i--) {
sb.append(arr[i]);
if (i > 0) sb.append(" ");
}
System.out.println(sb.toString());
}
}
fun main() {
val arr = intArrayOf(1, 2, 3, 4, 5)
arr.reverse()
println(arr.joinToString(" "))
}
var arr = [1, 2, 3, 4, 5]
arr.reverse()
print(arr.map { String($0) }.joined(separator: " "))
void main() {
List<int> arr = [1, 2, 3, 4, 5];
var reversed = arr.reversed.toList();
print(reversed.join(' '));
}
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int arr[] = {1, 2, 3, 4, 5};
int n = 5;
reverse(arr, arr + n);
for (int i = 0; i < n; i++) {
cout << arr[i];
if (i < n - 1) cout << " ";
}
cout << endl;
return 0;
}
#include <stdio.h>
int main() {
int arr[] = {1, 2, 3, 4, 5};
int n = 5;
for (int i = n - 1; i >= 0; i--) {
printf("%d", arr[i]);
if (i > 0) printf(" ");
}
printf("\n");
return 0;
}