add 1258

Author: fishercoder1534

README.md

@@ -46,6 +46,7 @@ _If you like this project, please leave me a star._ ★
 |1265|[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse//)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1265.java) |   |Medium||
 |1261|[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1261.java) ||Medium|Tree, HashTable|
 |1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s)|Easy||
+|1258|[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1258.java) ||Medium|Backtracking|
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) |  |Easy||
 |1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | |Easy||
 |1243|[Array Transformation](https://leetcode.com/problems/array-transformation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) |  [:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs)|Easy||

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

@@ -0,0 +1,98 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+
+/**
+ * 1258. Synonymous Sentences
+ *
+ * Given a list of pairs of equivalent words synonyms and a sentence text, Return all possible synonymous sentences sorted lexicographically.
+ *
+ * Example 1:
+ * Input:
+ * synonyms = [["happy","joy"],["sad","sorrow"],["joy","cheerful"]],
+ * text = "I am happy today but was sad yesterday"
+ * Output:
+ * ["I am cheerful today but was sad yesterday",
+ * ​​​​​​​"I am cheerful today but was sorrow yesterday",
+ * "I am happy today but was sad yesterday",
+ * "I am happy today but was sorrow yesterday",
+ * "I am joy today but was sad yesterday",
+ * "I am joy today but was sorrow yesterday"]
+ *
+ * Constraints:
+ * 0 <= synonyms.length <= 10
+ * synonyms[i].length == 2
+ * synonyms[0] != synonyms[1]
+ * All words consist of at most 10 English letters only.
+ * text is a single space separated sentence of at most 10 words.
+ * */
+public class _1258 {
+    public static class Solution1 {
+        public List<String> generateSentences(List<List<String>> synonyms, String text) {
+            String[] words = text.split(" ");
+            Map<String, Set<String>> map = buildSynonymDict(words, synonyms);
+            Set<String> result = new HashSet<>();
+            result.add(text);
+            for (int i = 0; i < words.length; i++) {
+                List<String> list = new ArrayList<>();
+                for (String next : result) {
+                    list.add(next);
+                    list.addAll(findAllSynonymForThisWord(next, i, map));
+                }
+                result.addAll(list);
+            }
+            List<String> list = new ArrayList<>();
+            list.addAll(result);
+            Collections.sort(list);
+            return list;
+        }
+
+        private List<String> findAllSynonymForThisWord(String sentence, int i, Map<String, Set<String>> map) {
+            String[] words = sentence.split(" ");
+            List<String> list = new ArrayList<>();
+            Set<String> synonyms = map.get(words[i]);
+            for (String s : synonyms) {
+                words[i] = s;
+                list.add(formWord(words));
+            }
+            return list;
+        }
+
+        private String formWord(String[] words) {
+            StringBuilder sb = new StringBuilder();
+            for (String word : words) {
+                sb.append(word);
+                sb.append(" ");
+            }
+            return sb.substring(0, sb.length() - 1);
+        }
+
+        private Map<String, Set<String>> buildSynonymDict(String[] words, List<List<String>> synonyms) {
+            Map<String, Set<String>> map = new HashMap<>();
+            for (String key : words) {
+                if (!map.containsKey(key)) {
+                    map.put(key, new HashSet<>());
+                }
+                map.get(key).add(key);
+            }
+            for (List<String> list : synonyms) {
+                for (String key : map.keySet()) {
+                    if (map.get(key).contains(list.get(0))) {
+                        map.get(key).add(list.get(1));
+                    } else if (map.get(key).contains(list.get(1))) {
+                        map.get(key).add(list.get(0));
+                    }
+                }
+            }
+            return map;
+        }
+
+    }
+}

src/test/java/com/fishercoder/_1258Test.java

@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1258;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1258Test {
+
+    private static _1258.Solution1 solution1;
+    private static List<List<String>> synonyms;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1258.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        synonyms = Arrays.asList(Arrays.asList("happy", "joy"), Arrays.asList("sad", "sorrow"), Arrays.asList("joy", "cheerful"));
+        List<String> expected = Arrays.asList("I am cheerful today but was sad yesterday", "I am cheerful today but was sorrow yesterday", "I am happy today but was sad yesterday", "I am happy today but was sorrow yesterday",
+                "I am joy today but was sad yesterday", "I am joy today but was sorrow yesterday");
+        assertEquals(expected, solution1.generateSentences(synonyms, "I am happy today but was sad yesterday"));
+    }
+
+}