add 14078

fishercoder1534 · fishercoder1534 · commit 3726038d0449 · 2020-04-12T06:53:39.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | |Easy|String|
 |1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | |Easy|Greedy, Sort|
 |1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | |Medium|Geometry|
 |1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | |Medium|Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1408.java b/src/main/java/com/fishercoder/solutions/_1408.java
@@ -0,0 +1,55 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+/**
+ * 1408. String Matching in an Array
+ *
+ * Given an array of string words. Return all strings in words which is substring of another word in any order.
+ * String words[i] is substring of words[j], if can be obtained removing some characters to left and/or right side of words[j].
+ *
+ * Example 1:
+ * Input: words = ["mass","as","hero","superhero"]
+ * Output: ["as","hero"]
+ * Explanation: "as" is substring of "mass" and "hero" is substring of "superhero".
+ * ["hero","as"] is also a valid answer.
+ *
+ * Example 2:
+ * Input: words = ["leetcode","et","code"]
+ * Output: ["et","code"]
+ * Explanation: "et", "code" are substring of "leetcode".
+ *
+ * Example 3:
+ * Input: words = ["blue","green","bu"]
+ * Output: []
+ *
+ * Constraints:
+ * 1 <= words.length <= 100
+ * 1 <= words[i].length <= 30
+ * words[i] contains only lowercase English letters.
+ * It's guaranteed that words[i] will be unique.
+ * */
+public class _1408 {
+    public static class Solution1 {
+        public List<String> stringMatching(String[] words) {
+            Set<String> set = new HashSet<>();
+            for (String word : words) {
+                for (int i = 0; i < words.length; i++) {
+                    if (!word.equals(words[i]) && word.length() < words[i].length()) {
+                        if (words[i].indexOf(word) != -1) {
+                            set.add(word);
+                        }
+                    }
+                }
+            }
+            List<String> result = new ArrayList<>();
+            for (String s : set) {
+                result.add(s);
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1408Test.java b/src/test/java/com/fishercoder/_1408Test.java
@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1408;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1408Test {
+    private static _1408.Solution1 solution1;
+    private static String[] words;
+    private static List<String> expected;
+    private static List<String> actual;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1408.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        words = new String[]{"mass", "as", "hero", "superhero"};
+        expected = Arrays.asList("as", "hero");
+        actual = solution1.stringMatching(words);
+        assertEquals(expected.containsAll(actual), actual.containsAll(expected));
+    }
+
+}
