feat: update solutions to lc problem: No.0734

No.0734.Sentence Similarity

solution/0600-0699/0605.Can Place Flowers/Solution.py

@@ -2,7 +2,7 @@ class Solution:
     def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool:
         flowerbed = [0] + flowerbed + [0]
         for i in range(1, len(flowerbed) - 1):
-            if sum(flowerbed[i - 1: i + 2]) == 0:
+            if sum(flowerbed[i - 1 : i + 2]) == 0:
                 flowerbed[i] = 1
                 n -= 1
         return n <= 0

solution/0600-0699/0616.Add Bold Tag in String/Solution.py

@@ -49,9 +49,9 @@ def addBoldTag(self, s: str, words: List[str]) -> str:
                 break
             st, ed = t[j]
             if i < st:
-                ans.append(s[i: st])
+                ans.append(s[i:st])
             ans.append('<b>')
-            ans.append(s[st: ed + 1])
+            ans.append(s[st : ed + 1])
             ans.append('</b>')
             j += 1
             i = ed + 1

solution/0700-0799/0734.Sentence Similarity/README.md

@@ -64,7 +64,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-“哈希表”实现。
+**方法一：哈希表**
 
 <!-- tabs:start -->
 
@@ -77,12 +77,8 @@ class Solution:
     def areSentencesSimilar(self, sentence1: List[str], sentence2: List[str], similarPairs: List[List[str]]) -> bool:
         if len(sentence1) != len(sentence2):
             return False
-        pairs = {(word1, word2) for word1, word2 in similarPairs}
-        for i in range(len(sentence1)):
-            similar = (sentence1[i], sentence2[i]) in pairs or (sentence2[i], sentence1[i]) in pairs or sentence1[i] == sentence2[i]
-            if not similar:
-                return False
-        return True
+        s = {(a, b) for a, b in similarPairs}
+        return all(a == b or (a, b) in s or (b, a) in s for a, b in zip(sentence1, sentence2))
 ```
 
 ### **Java**
@@ -95,13 +91,13 @@ class Solution {
         if (sentence1.length != sentence2.length) {
             return false;
         }
-        Set<String> pairs = new HashSet<>();
-        for (List<String> pair : similarPairs) {
-            pairs.add(pair.get(0) + "." + pair.get(1));
+        Set<String> s = new HashSet<>();
+        for (List<String> e : similarPairs) {
+            s.add(e.get(0) + "." + e.get(1));
         }
         for (int i = 0; i < sentence1.length; ++i) {
-            boolean similar =  pairs.contains(sentence1[i] + "." + sentence2[i]) || pairs.contains(sentence2[i] + "." + sentence1[i]) || sentence1[i].equals(sentence2[i]);
-            if (!similar) {
+            String a = sentence1[i], b = sentence2[i];
+            if (!a.equals(b) && !s.contains(a + "." + b) && !s.contains(b + "." + a)) {
                 return false;
             }
         }
@@ -110,6 +106,47 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool areSentencesSimilar(vector<string>& sentence1, vector<string>& sentence2, vector<vector<string>>& similarPairs) {
+        int m = sentence1.size(), n = sentence2.size();
+        if (m != n) return false;
+        unordered_set<string> s;
+        for (auto e : similarPairs) s.insert(e[0] + "." + e[1]);
+        for (int i = 0; i < n; ++i)
+        {
+            string a = sentence1[i], b = sentence2[i];
+            if (a != b && !s.count(a + "." + b) && !s.count(b + "." + a)) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func areSentencesSimilar(sentence1 []string, sentence2 []string, similarPairs [][]string) bool {
+	if len(sentence1) != len(sentence2) {
+		return false
+	}
+	s := map[string]bool{}
+	for _, e := range similarPairs {
+		s[e[0]+"."+e[1]] = true
+	}
+	for i, a := range sentence1 {
+		b := sentence2[i]
+		if a != b && !s[a+"."+b] && !s[b+"."+a] {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0734.Sentence Similarity/README_EN.md

@@ -69,12 +69,8 @@ class Solution:
     def areSentencesSimilar(self, sentence1: List[str], sentence2: List[str], similarPairs: List[List[str]]) -> bool:
         if len(sentence1) != len(sentence2):
             return False
-        pairs = {(word1, word2) for word1, word2 in similarPairs}
-        for i in range(len(sentence1)):
-            similar = (sentence1[i], sentence2[i]) in pairs or (sentence2[i], sentence1[i]) in pairs or sentence1[i] == sentence2[i]
-            if not similar:
-                return False
-        return True
+        s = {(a, b) for a, b in similarPairs}
+        return all(a == b or (a, b) in s or (b, a) in s for a, b in zip(sentence1, sentence2))
 ```
 
 ### **Java**
@@ -85,13 +81,13 @@ class Solution {
         if (sentence1.length != sentence2.length) {
             return false;
         }
-        Set<String> pairs = new HashSet<>();
-        for (List<String> pair : similarPairs) {
-            pairs.add(pair.get(0) + "." + pair.get(1));
+        Set<String> s = new HashSet<>();
+        for (List<String> e : similarPairs) {
+            s.add(e.get(0) + "." + e.get(1));
         }
         for (int i = 0; i < sentence1.length; ++i) {
-            boolean similar =  pairs.contains(sentence1[i] + "." + sentence2[i]) || pairs.contains(sentence2[i] + "." + sentence1[i]) || sentence1[i].equals(sentence2[i]);
-            if (!similar) {
+            String a = sentence1[i], b = sentence2[i];
+            if (!a.equals(b) && !s.contains(a + "." + b) && !s.contains(b + "." + a)) {
                 return false;
             }
         }
@@ -100,6 +96,47 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool areSentencesSimilar(vector<string>& sentence1, vector<string>& sentence2, vector<vector<string>>& similarPairs) {
+        int m = sentence1.size(), n = sentence2.size();
+        if (m != n) return false;
+        unordered_set<string> s;
+        for (auto e : similarPairs) s.insert(e[0] + "." + e[1]);
+        for (int i = 0; i < n; ++i)
+        {
+            string a = sentence1[i], b = sentence2[i];
+            if (a != b && !s.count(a + "." + b) && !s.count(b + "." + a)) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func areSentencesSimilar(sentence1 []string, sentence2 []string, similarPairs [][]string) bool {
+	if len(sentence1) != len(sentence2) {
+		return false
+	}
+	s := map[string]bool{}
+	for _, e := range similarPairs {
+		s[e[0]+"."+e[1]] = true
+	}
+	for i, a := range sentence1 {
+		b := sentence2[i]
+		if a != b && !s[a+"."+b] && !s[b+"."+a] {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0734.Sentence Similarity/Solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    bool areSentencesSimilar(vector<string>& sentence1, vector<string>& sentence2, vector<vector<string>>& similarPairs) {
+        int m = sentence1.size(), n = sentence2.size();
+        if (m != n) return false;
+        unordered_set<string> s;
+        for (auto e : similarPairs) s.insert(e[0] + "." + e[1]);
+        for (int i = 0; i < n; ++i)
+        {
+            string a = sentence1[i], b = sentence2[i];
+            if (a != b && !s.count(a + "." + b) && !s.count(b + "." + a)) return false;
+        }
+        return true;
+    }
+};

solution/0700-0799/0734.Sentence Similarity/Solution.go

@@ -0,0 +1,16 @@
+func areSentencesSimilar(sentence1 []string, sentence2 []string, similarPairs [][]string) bool {
+	if len(sentence1) != len(sentence2) {
+		return false
+	}
+	s := map[string]bool{}
+	for _, e := range similarPairs {
+		s[e[0]+"."+e[1]] = true
+	}
+	for i, a := range sentence1 {
+		b := sentence2[i]
+		if a != b && !s[a+"."+b] && !s[b+"."+a] {
+			return false
+		}
+	}
+	return true
+}

solution/0700-0799/0734.Sentence Similarity/Solution.java

@@ -3,13 +3,13 @@ public boolean areSentencesSimilar(String[] sentence1, String[] sentence2, List<
         if (sentence1.length != sentence2.length) {
             return false;
         }
-        Set<String> pairs = new HashSet<>();
-        for (List<String> pair : similarPairs) {
-            pairs.add(pair.get(0) + "." + pair.get(1));
+        Set<String> s = new HashSet<>();
+        for (List<String> e : similarPairs) {
+            s.add(e.get(0) + "." + e.get(1));
         }
         for (int i = 0; i < sentence1.length; ++i) {
-            boolean similar =  pairs.contains(sentence1[i] + "." + sentence2[i]) || pairs.contains(sentence2[i] + "." + sentence1[i]) || sentence1[i].equals(sentence2[i]);
-            if (!similar) {
+            String a = sentence1[i], b = sentence2[i];
+            if (!a.equals(b) && !s.contains(a + "." + b) && !s.contains(b + "." + a)) {
                 return false;
             }
         }

solution/0700-0799/0734.Sentence Similarity/Solution.py

@@ -4,13 +4,7 @@ def areSentencesSimilar(
     ) -> bool:
         if len(sentence1) != len(sentence2):
             return False
-        pairs = {(word1, word2) for word1, word2 in similarPairs}
-        for i in range(len(sentence1)):
-            similar = (
-                (sentence1[i], sentence2[i]) in pairs
-                or (sentence2[i], sentence1[i]) in pairs
-                or sentence1[i] == sentence2[i]
-            )
-            if not similar:
-                return False
-        return True
+        s = {(a, b) for a, b in similarPairs}
+        return all(
+            a == b or (a, b) in s or (b, a) in s for a, b in zip(sentence1, sentence2)
+        )

solution/0700-0799/0758.Bold Words in String/Solution.py

@@ -49,9 +49,9 @@ def boldWords(self, words: List[str], s: str) -> str:
                 break
             st, ed = t[j]
             if i < st:
-                ans.append(s[i: st])
+                ans.append(s[i:st])
             ans.append('<b>')
-            ans.append(s[st: ed + 1])
+            ans.append(s[st : ed + 1])
             ans.append('</b>')
             j += 1
             i = ed + 1