add 1452

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1452|[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1452.java) | |Medium|String, Sort|
 |1451|[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1451.java) | |Medium|String, Sort|
 |1450|[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java) | |Easy|Array|
 |1448|[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java) | |Medium|Tree, DFS|

src/main/java/com/fishercoder/solutions/_1452.java

@@ -0,0 +1,70 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeMap;
+
+public class _1452 {
+    public static class Solution1 {
+        public List<Integer> peopleIndexes(List<List<String>> favoriteCompanies) {
+            TreeMap<String, Integer> map = new TreeMap<>(new Comparator<String>() {
+                @Override
+                public int compare(String o1, String o2) {
+                    int diff_length = o1.length() - o2.length();
+                    if (diff_length != 0) return diff_length;
+                    return o1.compareTo(o2);
+                }
+            });
+            Map<String, Set<String>> setMap = new HashMap<>();
+            for (int i = 0; i < favoriteCompanies.size(); i++) {
+                List<String> list = favoriteCompanies.get(i);
+                Collections.sort(list);
+                StringBuilder sb = new StringBuilder();
+                Set<String> set = new HashSet<>();
+                for (String str : list) {
+                    sb.append(str);
+                    set.add(str);
+                }
+                map.put(sb.toString(), i);
+                setMap.put(sb.toString(), set);
+            }
+            List<String> keys = new ArrayList<>();
+            for (String key : map.keySet()) {
+                keys.add(key);
+            }
+            List<Integer> result = new ArrayList<>();
+            for (int i = 0; i < keys.size(); i++) {
+                boolean goodCandidate = true;
+                for (int j = 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 (int j = 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);
+            return result;
+        }
+    }
+}

src/test/java/com/fishercoder/_1452Test.java

@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1452;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1452Test {
+    private static _1452.Solution1 solution1;
+    private static List<List<String>> favoriteCompanies;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1452.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        favoriteCompanies = new ArrayList<>();
+        favoriteCompanies.add(Arrays.asList("leetcode", "google", "facebook"));
+        favoriteCompanies.add(Arrays.asList("google", "microsoft"));
+        favoriteCompanies.add(Arrays.asList("google", "facebook"));
+        favoriteCompanies.add(Arrays.asList("google"));
+        favoriteCompanies.add(Arrays.asList("amazon"));
+        assertEquals(Arrays.asList(0, 1, 4), solution1.peopleIndexes(favoriteCompanies));
+    }
+
+    @Test
+    public void test2() {
+        favoriteCompanies = new ArrayList<>();
+        favoriteCompanies.add(Arrays.asList("nxaqhyoprhlhvhyojanr", "ovqdyfqmlpxapbjwtssm", "qmsbphxzmnvflrwyvxlc", "udfuxjdxkxwqnqvgjjsp", "yawoixzhsdkaaauramvg", "zycidpyopumzgdpamnty"));//6
+        favoriteCompanies.add(Arrays.asList("nxaqhyoprhlhvhyojanr", "ovqdyfqmlpxapbjwtssm", "udfuxjdxkxwqnqvgjjsp", "yawoixzhsdkaaauramvg", "zycidpyopumzgdpamnty"));//5
+        favoriteCompanies.add(Arrays.asList("ovqdyfqmlpxapbjwtssm", "qmsbphxzmnvflrwyvxlc", "udfuxjdxkxwqnqvgjjsp", "yawoixzhsdkaaauramvg", "zycidpyopumzgdpamnty"));//5
+        assertEquals(Arrays.asList(0), solution1.peopleIndexes(favoriteCompanies));
+    }
+
+}