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 {
//напишите тут ваш код
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
ArrayList<String> mass = new ArrayList<String>();
for(int i =0; i<10; i++){
String s = reader. readLine();
mass.add(s);
}
int max = (mass.get(0)).length();
int min = (mass.get(0)).length();
String shortest = null;
String longest = null;
ArrayList<String> sh = new ArrayList<String>();
ArrayList<String> lg = new ArrayList<String>();
for(int i = 0; i<mass.size();i++){
if ((mass.get(i).length()) >= max)
{
max = mass.get(i).length();
longest = mass.get(i);
lg.add(longest);continue;
}
}
for(int j = 0; j<mass.size();j++)
{
if((mass.get(j).length()) <= min) {
min = mass.get(j).length();
shortest = mass.get(j);
sh.add(shortest);continue;
}
}
if(mass.indexOf(shortest)< mass.indexOf(longest))
{
for(int i =0; i<sh.size();i++)
{
System.out.println(sh.get(i));
}
}
if(mass.indexOf(longest)< mass.indexOf(shortest))
{
for(int i=0; i<lg.size();i++)
{
System.out.println(lg.get(i));
}
}
}
}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 {
//напишите тут ваш код
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
ArrayList<String> mass = new ArrayList<String>();
for(int i =0; i<10; i++){
String s = reader. readLine();
mass.add(s);
}
int max = (mass.get(0)).length();
int min = (mass.get(0)).length();
String shortest = null;
String longest = null;
ArrayList<String> sh = new ArrayList<String>();
ArrayList<String> lg = new ArrayList<String>();
for(int i = 0; i<mass.size();i++){
if ((mass.get(i).length()) >= max)
{
max = mass.get(i).length();
longest = mass.get(i);
lg.add(longest);continue;
}
}
for(int j = 0; j<mass.size();j++) {
if((mass.get(j).length()) <= min) {
min = mass.get(j).length();
shortest = mass.get(j);
sh.add(shortest);continue;
}
}
if(mass.indexOf(shortest)< mass.indexOf(longest)){
for(int i =0; i<sh.size();i++)
{
System.out.println(sh.get(i));
}
}
if(mass.indexOf(longest)< mass.indexOf(shortest)){
for(int i=0; i<lg.size();i++)
{
System.out.println(lg.get(i));
}
}
}
}