feat: add solutions to lc problem: No.1258

No.1258.Synonymous Sentences

Author: yanglbme

solution/1200-1299/1257.Smallest Common Region/README.md

@@ -127,28 +127,29 @@ public:
 };
 ```
 
-### **C++**
-
-```cpp
-class Solution {
-public:
-    string findSmallestRegion(vector<vector<string>>& regions, string region1, string region2) {
-        unordered_map<string, string> m;
-        for (auto& region : regions)
-            for (int i = 1; i < region.size(); ++i)
-                m[region[i]] = region[0];
-        unordered_set<string> s;
-        while (m.count(region1)) {
-            s.insert(region1);
-            region1 = m[region1];
-        }
-        while (m.count(region2)) {
-            if (s.count(region2)) return region2;
-            region2 = m[region2];
-        }
-        return region1;
-    }
-};
+### **Go**
+
+```go
+func findSmallestRegion(regions [][]string, region1 string, region2 string) string {
+	m := make(map[string]string)
+	for _, region := range regions {
+		for i := 1; i < len(region); i++ {
+			m[region[i]] = region[0]
+		}
+	}
+	s := make(map[string]bool)
+	for region1 != "" {
+		s[region1] = true
+		region1 = m[region1]
+	}
+	for region2 != "" {
+		if s[region2] {
+			return region2
+		}
+		region2 = m[region2]
+	}
+	return region1
+}
 ```
 
 ### **...**

solution/1200-1299/1257.Smallest Common Region/README_EN.md

@@ -124,6 +124,31 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func findSmallestRegion(regions [][]string, region1 string, region2 string) string {
+	m := make(map[string]string)
+	for _, region := range regions {
+		for i := 1; i < len(region); i++ {
+			m[region[i]] = region[0]
+		}
+	}
+	s := make(map[string]bool)
+	for region1 != "" {
+		s[region1] = true
+		region1 = m[region1]
+	}
+	for region2 != "" {
+		if s[region2] {
+			return region2
+		}
+		region2 = m[region2]
+	}
+	return region1
+}
+```
+
 ### **...**
 
 ```