_1452.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.Collections;
importjava.util.Comparator;
importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.List;
importjava.util.Map;
importjava.util.Set;
importjava.util.TreeMap;

publicclass_1452 {
publicstaticclassSolution1 {
publicList<Integer> peopleIndexes(List<List<String>> favoriteCompanies) {
TreeMap<String, Integer> map =
newTreeMap<>(
newComparator<String>() {
@Override
publicintcompare(Stringo1, Stringo2) {
intdiffLength = o1.length() - o2.length();
if (diffLength != 0) {
returndiffLength;
 }
returno1.compareTo(o2);
 }
 });
Map<String, Set<String>> setMap = newHashMap<>();
for (inti = 0; i < favoriteCompanies.size(); i++) {
List<String> list = favoriteCompanies.get(i);
Collections.sort(list);
StringBuildersb = newStringBuilder();
Set<String> set = newHashSet<>();
for (Stringstr : list) {
sb.append(str);
set.add(str);
 }
map.put(sb.toString(), i);
setMap.put(sb.toString(), set);
 }
List<String> keys = newArrayList<>();
for (Stringkey : map.keySet()) {
keys.add(key);
 }
List<Integer> result = newArrayList<>();
for (inti = 0; i < keys.size(); i++) {
booleangoodCandidate = true;
for (intj = i + 1; j < keys.size(); j++) {
if (keys.get(j).contains(keys.get(i))) {
goodCandidate = false;
break;
 }
 }
if (goodCandidate) {
Set<String> smallerSet = setMap.get(keys.get(i));
for (intj = 0; j < keys.size(); j++) {
if (j != i) {
Set<String> biggerSet = setMap.get(keys.get(j));
if (biggerSet.containsAll(smallerSet)) {
goodCandidate = false;
break;
 }
 }
 }
 }
if (goodCandidate) {
result.add(map.get(keys.get(i)));
 }
 }
Collections.sort(result);
returnresult;
 }
 }
}