чекніть
package com.javarush.task.task07.task0712;
import java.awt.List;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
/*
Самые-самые
*/
public class Solution {
public static void main(String[] args) throws IOException {
final int LENGTH = 10;
String[] list = new String[LENGTH];
writeToArray(list);
String[] copyList = list.clone();
//Arrays.sort(copyList);
list = bumbleSort(list);
//System.out.println(Arrays.toString(list));
findLine(list, copyList);
}
/*
* method write in list
*/
private static void writeToArray(String[] list) throws IOException {
for (int i = 0; i < 10; i++) {
list[i] = new BufferedReader(new InputStreamReader(System.in)).readLine();
}
}
/*
* method which find what is first smallest line or longest
*/
static private void findLine(String[] list, String[] copyList) {
String less = list[0];int more = list[9].length();
for (int i = 0; i < 10; i++) {
if (copyList[i].equals(less)) {
System.out.println(copyList[i]);
return;
}
if (copyList[i].length()==more) {
System.out.println(copyList[i]);
return;
}
}
}
/*
* sort in java
*/
static private String[] bumbleSort (String[] array) {
int count =0;
boolean repeat = true;
while (repeat) {
repeat = false;
for(int i =0;i< array.length-1;i++) {
if(array[i].length()>array[i+1].length()) {
String temp = array[i];
array[i]= array[i+1];
array[i+1] = temp;
repeat = true;
}
//count+=1;
}
}
return array;
}
}