21 lines
567 B
Java
21 lines
567 B
Java
|
public class Exo1{
|
||
|
|
|
||
|
|
public static String plusCourt(String[] tab){
|
||
|
|
try{
|
||
|
|
String min;
|
||
|
|
int i = 0;
|
||
|
|
while(tab[i]==null){
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
min = tab[i];
|
||
|
|
for(i++;i<tab.length;i++){
|
||
|
|
if((tab[i] != null) && tab[i].length()< min.length()){
|
||
|
|
min = tab[i];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return min;
|
||
|
|
}catch(ArrayIndexOutOfBoundsException ex){
|
||
|
|
throw new IllegalArgumentException("aucune chaîne trouvée");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|