package fr.codegym.task.task07.task0712; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; /* La plus petite ou la plus longue chaîne */ public class Solution { public static void main(String[] args) throws Exception { ArrayList<String> list = new ArrayList<String>(); BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); for (int i=0;i<10;i++){ list.add(reader.readLine()); } int lmax = 0; for (int i=0;i<list.size();i++){ if (list.get(i).length() > lmax) {lmax = list.get(i).length(); } else { } } int lmin = 20; for (int i=0;i<list.size();i++){ if (list.get(i).length() < lmin) {lmin = list.get(i).length(); } else { } } int lmaxf =0; int lminf =0; for (int i=0;i<list.size();i++){ if ((list.get(i).length() == lmin)&&(lminf!=0)){lminf = i;} else if ((list.get(i).length() == lmax)&&(lmaxf!=0)){lmaxf = i;} } if (lmaxf<lminf){ System.out.println(list.get(lmaxf)); } else { System.out.println(list.get(lminf)); } //écris ton code ici } }