feat: add solutions to lc problems: No.0760,1198

Author: yanglbme

solution/0700-0799/0760.Find Anagram Mappings/README.md

@@ -50,15 +50,36 @@ B = [50, 12, 32, 46, 28]
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def anagramMappings(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = collections.defaultdict(set)
+        for i, num in enumerate(nums2):
+            mapper[num].add(i)
+        return [mapper[num].pop() for num in nums1]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] anagramMappings(int[] nums1, int[] nums2) {
+        Map<Integer, Set<Integer>> map = new HashMap<>();
+        for (int i = 0; i < nums2.length; ++i) {
+            Set<Integer> s = map.getOrDefault(nums2[i], new HashSet<>());
+            s.add(i);
+            map.put(nums2[i], s);
+        }
+        int[] res = new int[nums1.length];
+        for (int i = 0; i < nums1.length; ++i) {
+            int idx = map.get(nums1[i]).iterator().next();
+            res[i] = idx;
+            map.get(nums1[i]).remove(idx);
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0760.Find Anagram Mappings/README_EN.md

@@ -67,13 +67,34 @@ and so on.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def anagramMappings(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = collections.defaultdict(set)
+        for i, num in enumerate(nums2):
+            mapper[num].add(i)
+        return [mapper[num].pop() for num in nums1]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] anagramMappings(int[] nums1, int[] nums2) {
+        Map<Integer, Set<Integer>> map = new HashMap<>();
+        for (int i = 0; i < nums2.length; ++i) {
+            Set<Integer> s = map.getOrDefault(nums2[i], new HashSet<>());
+            s.add(i);
+            map.put(nums2[i], s);
+        }
+        int[] res = new int[nums1.length];
+        for (int i = 0; i < nums1.length; ++i) {
+            int idx = map.get(nums1[i]).iterator().next();
+            res[i] = idx;
+            map.get(nums1[i]).remove(idx);
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0760.Find Anagram Mappings/Solution.java

@@ -1,15 +1,16 @@
-import java.util.*;
-
 class Solution {
-    public int[] anagramMappings(int[] A, int[] B) {
-        Map<Integer, Integer> map = new HashMap<>();
-        for (int i = 0; i < B.length; i++) {
-            map.put(B[i], i);
+    public int[] anagramMappings(int[] nums1, int[] nums2) {
+        Map<Integer, Set<Integer>> map = new HashMap<>();
+        for (int i = 0; i < nums2.length; ++i) {
+            Set<Integer> s = map.getOrDefault(nums2[i], new HashSet<>());
+            s.add(i);
+            map.put(nums2[i], s);
         }
-        int[] res = new int[B.length];
-        int j = 0;
-        for (int k : A) {
-            res[j++] = map.get(k);
+        int[] res = new int[nums1.length];
+        for (int i = 0; i < nums1.length; ++i) {
+            int idx = map.get(nums1[i]).iterator().next();
+            res[i] = idx;
+            map.get(nums1[i]).remove(idx);
         }
         return res;
     }

solution/0700-0799/0760.Find Anagram Mappings/Solution.py

@@ -1,9 +1,6 @@
 class Solution:
-    def anagramMappings(self, A, B):
-        """
-        :type A: List[int]
-        :type B: List[int]
-        :rtype: List[int]
-        """
-        record = {val: i for i, val in enumerate(B)}
-        return [record[val] for val in A]
+    def anagramMappings(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        mapper = collections.defaultdict(set)
+        for i, num in enumerate(nums2):
+            mapper[num].add(i)
+        return [mapper[num].pop() for num in nums1]

solution/1100-1199/1198.Find Smallest Common Element in All Rows/README.md

@@ -29,27 +29,49 @@
 	<li><code>mat[i]</code> 已按严格递增顺序排列。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+“计数器”实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def smallestCommonElement(self, mat: List[List[int]]) -> int:
+        counter = collections.Counter()
+        for row in mat:
+            for num in row:
+                counter[num] += 1
+                if counter[num] == len(mat):
+                    return num
+        return -1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int smallestCommonElement(int[][] mat) {
+        int[] counter = new int[10001];
+        for (int[] row : mat) {
+            for (int num : row) {
+                ++counter[num];
+                if (counter[num] == mat.length) {
+                    return num;
+                }
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **...**

solution/1100-1199/1198.Find Smallest Common Element in All Rows/README_EN.md

@@ -34,21 +34,41 @@
 	<li><code>mat[i]</code> is sorted in strictly increasing order.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def smallestCommonElement(self, mat: List[List[int]]) -> int:
+        counter = collections.Counter()
+        for row in mat:
+            for num in row:
+                counter[num] += 1
+                if counter[num] == len(mat):
+                    return num
+        return -1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int smallestCommonElement(int[][] mat) {
+        int[] counter = new int[10001];
+        for (int[] row : mat) {
+            for (int num : row) {
+                ++counter[num];
+                if (counter[num] == mat.length) {
+                    return num;
+                }
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **...**

solution/1100-1199/1198.Find Smallest Common Element in All Rows/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int smallestCommonElement(int[][] mat) {
+        int[] counter = new int[10001];
+        for (int[] row : mat) {
+            for (int num : row) {
+                ++counter[num];
+                if (counter[num] == mat.length) {
+                    return num;
+                }
+            }
+        }
+        return -1;
+    }
+}

solution/1100-1199/1198.Find Smallest Common Element in All Rows/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def smallestCommonElement(self, mat: List[List[int]]) -> int:
+        counter = collections.Counter()
+        for row in mat:
+            for num in row:
+                counter[num] += 1
+                if counter[num] == len(mat):
+                    return num
+        return -1