ΠΠ΅ ΠΏΠΎΠΉΠΌΡ Π² ΡΠ΅ΠΌ ΠΏΡΠΈΡΠΈΠ½Π°? ΠΠΎΠΌΠΎΠ³ΠΈΡΠ΅ ΠΏΠΎΠΆΠ°Π»ΡΠΉΡΡΠ°.
package com.javarush.task.task07.task0712;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
/*
Π‘Π°ΠΌΡΠ΅-ΡΠ°ΠΌΡΠ΅
*/
public class Solution {
public static void main(String[] args) throws Exception {
//Π½Π°ΠΏΠΈΡΠΈΡΠ΅ ΡΡΡ Π²Π°Ρ ΠΊΠΎΠ΄
ArrayList<String> list = new ArrayList<>();
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
for(int i=0; i<10; i++ ){
list.add(reader.readLine());
}
int min = list.get(0).length();
int max = 0;
ArrayList<String> s_min = new ArrayList<>();
ArrayList<String> s_max = new ArrayList<>();
int num_min = 0;
int num_max = 0;
//ΡΠ°ΠΌΠ°Ρ ΠΊΠΎΡΠΎΡΠΊΠ°Ρ
for (int i=0; i < 10; i++){
if (min > list.get(i).length()){
min = list.get(i).length();
s_min.add(0,list.get(i));
num_min = i;
}
}
//ΡΠ°ΠΌΠ°Ρ Π΄Π»ΠΈΠ½Π½Π°Ρ
for (int i=0; i < 10; i++){
if (max < list.get(i).length()){
max = list.get(i).length();
s_max.add(0,list.get(i));
num_max = i;
}
}
//ΠΊΠ°ΠΊΠΎΠΉ Π½ΠΎΠΌΠ΅Ρ ΠΌΠ΅Π½ΡΡΠ΅, Π·Π½Π°ΡΠΈΡ ΡΡΠ° ΡΡΡΠΎΠΊΠ° Π±ΡΠ»Π° ΡΠ°Π½ΡΡΠ΅ Π΅Π΅ ΠΈ Π²ΡΠ²ΠΎΠ΄ΠΈΠΌ
if (num_max < num_min){
System.out.println(s_max.get(0));
}
else
System.out.println(s_min.get(0));
}
}