-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrays.java
More file actions
66 lines (46 loc) · 1.57 KB
/
Copy pathArrays.java
File metadata and controls
66 lines (46 loc) · 1.57 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package com.HackerRank;
import java.io.*;
import java.util.*;
public class Arrays {
/*
* Hacker Rank Algorithm Question - Arrays - DS Solution
* *
* Category : Data Structure
* Solved Date : 2019-08-08
* Author : TK Lee
*
* Source : https://www.hackerrank.com/challenges/arrays-ds/problem
*/
// Complete the reverseArray function below.
static int[] reverseArray(int[] a) {
int[] ra = new int [a.length];
int cnt = 0;
for (int idx = a.length-1; idx >= 0; idx--){
ra[idx] = a[cnt++];
}
return ra;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int arrCount = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] arr = new int[arrCount];
String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < arrCount; i++) {
int arrItem = Integer.parseInt(arrItems[i]);
arr[i] = arrItem;
}
int[] res = reverseArray(arr);
for (int i = 0; i < res.length; i++) {
bufferedWriter.write(String.valueOf(res[i]));
if (i != res.length - 1) {
bufferedWriter.write(" ");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}