package ru.job4j.tasksortdeparament;


import java.util.*;

public class DescendingComporatorLow implements Comparator<Map.Entry<String, List<String>>> {


    @Override
    public int compare(Map.Entry<String, List<String>> o1, Map.Entry<String, List<String>> o2) {
        int compare;
        if (o1.getKey().length() < o2.getKey().length()) {
            compare = 1;
        } else if (o1.getKey().length() == o2.getKey().length())

            compare = 0;
        else (o1.getKey().length() > o2.getKey().length()) {
            compare = -1;
        }
        return compare;
    }
}
@@ -116,40 +116,15 @@
 tor%3C
-Map.Entry%3CString, List%3C
 String%3E
-%3E%3E
  %7B%0A%0A
@@ -165,402 +165,74 @@
 are(
-Map.Entry%3CString, List%3CString%3E%3E o1, Map.Entry%3CString, List%3CString%3E%3E o2) %7B%0A        int compare;%0A        if (o1.getKey().length() %3C o2.getKey().length()) %7B%0A            compare = 1;%0A        %7D else if (o1.getKey().length() == o2.getKey().length())%0A%0A            compare = 0;%0A        else (o1.getKey().length() %3E o2.getKey().length()) %7B%0A            compare = -1;%0A        %7D%0A        return compare;%0A    %7D%0A%7D
+String o1, String o2) %7B%0A        return o1.compareTo(o2);%0A%0A    %7D%0A%7D%0A%0A%0A%0A%0A

add new comporator