[Hackerrank] reverseArray

https://www.hackerrank.com/challenges/arrays-ds/problem

Arrays - DS | HackerRank

package exam.uploaded;


//https://www.hackerrank.com/challenges/arrays-ds/problem
public class reverseArray {
    public static class Solution {

        // Complete the reverseArray function below.
        static int[] reverseArray(int[] a) {
            int length = a.length;
            int[] answer = new int[length];

            for (int i = 0; i < length; i++) {
                answer[i] = a[length - i - 1];
            }
            return answer;
        }

//        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();
//        }
    }

}