Предпоследние условие
package com.javarush.task.task07.task0701;
import java.io.IOException;
/*
Массивный максимум
*/
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) throws Exception {
int[] array = initializeArray();
int max = max(array);
System.out.println(max);
}
public static int[] initializeArray() throws IOException {
// создай и заполни массив
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int[] list = new int [20];
for (int i = list[0]; i < list.length; i++)
{
list[i] = Integer.parseInt(reader.readLine());
}
return list;
}
public static int max(int[] array) {
int[] list = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,17, 18, 19, 20};
int max = list[0];
for (int i = list[0]; i < list.length; i++)
{
if (max<list[i])
max = list[i];
}
return max;
}
}