Created
January 6, 2015 00:03
-
-
Save roma-sck/e7a33b1b05b71ce91468 to your computer and use it in GitHub Desktop.
com.javarush.test.level07.lesson04.task04
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.javarush.test.level07.lesson04.task04; | |
import java.io.BufferedReader; | |
import java.io.InputStreamReader; | |
/* Массив из чисел в обратном порядке | |
1. Создать массив на 10 чисел. | |
2. Ввести с клавиатуры 10 чисел и записать их в массив. | |
3. Расположить элементы массива в обратном порядке. | |
4. Вывести результат на экран, каждое значение выводить с новой строки. | |
*/ | |
public class Solution | |
{ | |
public static void main(String[] args) throws Exception | |
{ | |
//Напишите тут ваш код | |
BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); | |
int[] num = new int[10]; | |
for (int i = 0; i < num.length; i++) | |
{ | |
num[i] = Integer.parseInt(br.readLine()); | |
} | |
for (int i = 0; i < num.length/2; i++) | |
{ | |
int tmp = num[i]; | |
num[i] = num[num.length - 1 - i]; | |
num[num.length - 1 - i] = tmp; | |
} | |
for (int i = 0; i < num.length; i++) | |
{ | |
System.out.println(num[i]); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment