Created
January 26, 2016 22:18
-
-
Save sunmeat/2b659e7adbc302f3e643 to your computer and use it in GitHub Desktop.
code sample for Android-8 (one-dimensional arrays)
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.sunmeat; | |
public class Program { | |
public static void main(String[] args) { | |
int size = 10; | |
int[] ar = new int[size]; | |
// заполнение массива циклом | |
for (int i = 0; i < ar.length; i++) | |
ar[i] = i + 1; | |
// показать элементы в обратном порядке | |
for (int i = ar.length - 1; i >= 0; i--) | |
System.out.print(ar[i] + " "); | |
System.out.println(); | |
// показать только чётные элементы | |
for (int i = 0; i < ar.length; i++) | |
if (ar[i] % 2 == 0) | |
System.out.print(ar[i] + " "); | |
System.out.println(); | |
// поиск минимального значения | |
int min = ar[0]; | |
for (int i = 1; i < ar.length; i++) | |
if (ar[i] < min) | |
min = ar[i]; | |
System.out.println(min); | |
// вычисление среднего арифметического | |
double sum = 0; | |
for (int i = 0; i < ar.length; i++) | |
sum += ar[i]; | |
double avg = sum / ar.length; | |
System.out.println(avg); | |
// инверсия массива | |
for (int i = 0, j = ar.length - 1; i < ar.length / 2; i++, j--) { | |
int temp = ar[i]; | |
ar[i] = ar[j]; | |
ar[j] = temp; | |
} | |
for (int i = 0; i < size; i++) | |
System.out.print(ar[i] + " "); | |
System.out.println(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment