public static int max(int[] array) {
int localMax = 0;
int max_id = 0;
for (int i = 0; i<array.length; i++)
if (array[i] > localMax) {
localMax = array[i];
max_id = i;
}
return localMax; //array[max_id]
}package com.javarush.task.task07.task0701;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/*
Массивный максимум
*/
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[] array = new int[20];
for(int i = 0;i<array.length;i++)
array[i] = Integer.parseInt(reader.readLine());
return array;
}
public static int max(int[] array) {
// найди максимальное значение
int localMax = 0;
int max_id = 0;
for (int i = 0;i<array.length;i++)
if(array[i] > localMax) {
localMax = array[i];
max_id = i;
}
return max_id;
}
}