feat: add solutions to lc problems: No.1791, 0997, 0590, 0589, 0099 (doocs#528)

* Updated Operator

* Added Python Solution to Problem No.590 to README_EN.md

* feat: add python solution to lc problem: No.0590. N-ary Tree Postorder Traversa

* Added Python solution No.590 to README.md

* feat: add python solution to lc problem: No. 0099. Recover Binary Search

* Added Python Solution NO.0099 to README.md

* Added Python Solution to No.0099  README_EN.md

* feat: add python solution to lc problem: No. 0997.Find the Town Judge

* Added Python Solution to No.0997 README.md

* Added Python Solution to No.0997 README_EN.md

* feat: add python solution to lc problem: No.1791. Find Center of StarGraph

* Added Python solution to No.1791 README.md

* Added Python Solution to NO.1791 README_EN.md

* feat: add python solution to lc problem: No.0589 N-ary Tree Preorder Traversal

* Added Python Solution to No.0589 README.md

* Added Python Solution to No.0589 README_EN.md

* Update solution/0500-0599/0590.N-ary Tree Postorder Traversal/README.md

* Update solution/0000-0099/0035.Search Insert Position/Solution.py

* Update solution/0500-0599/0590.N-ary Tree Postorder Traversal/README_EN.md

Co-authored-by: Yang Libin <contact@yanglibin.info>

Author: AshwinSolanki76

solution/0000-0099/0099.Recover Binary Search Tree/README.md

@@ -48,7 +48,31 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    first = None
+    second = None
+    prev = None
+    def recoverTree(self, root: TreeNode) -> None:
+        """
+        Do not return anything, modify root in-place instead.
+        """
+        def dfs(root):
+            if root:
+                dfs(root.left)
+                if self.prev and root.val < self.prev.val:
+                    if not self.first:
+                        self.first = self.prev
+                    self.second = root
+                self.prev = root
+                dfs(root.right)
+        dfs(root)
+        self.first.val, self.second.val = self.second.val, self.first.val
 ```
 
 ### **Java**

solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md

@@ -41,7 +41,31 @@
 ### **Python3**
 
 ```python
-
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    first = None
+    second = None
+    prev = None
+    def recoverTree(self, root: TreeNode) -> None:
+        """
+        Do not return anything, modify root in-place instead.
+        """
+        def dfs(root):
+            if root:
+                dfs(root.left)
+                if self.prev and root.val < self.prev.val:
+                    if not self.first:
+                        self.first = self.prev
+                    self.second = root
+                self.prev = root
+                dfs(root.right)
+        dfs(root)
+        self.first.val, self.second.val = self.second.val, self.first.val
 ```
 
 ### **Java**

solution/0000-0099/0099.Recover Binary Search Tree/Solution.py

@@ -0,0 +1,25 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    first = None
+    second = None
+    prev = None
+    def recoverTree(self, root: TreeNode) -> None:
+        """
+        Do not return anything, modify root in-place instead.
+        """
+        def dfs(root):
+            if root:
+                dfs(root.left)
+                if self.prev and root.val < self.prev.val:
+                    if not self.first:
+                        self.first = self.prev
+                    self.second = root
+                self.prev = root
+                dfs(root.right)
+        dfs(root)
+        self.first.val, self.second.val = self.second.val, self.first.val

solution/0500-0599/0589.N-ary Tree Preorder Traversal/README.md

@@ -60,7 +60,25 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def preorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            res.append(root.val)
+            for i in root.children:
+                PO(i)
+        res=[]
+        PO(root)
+        return res
 ```
 
 ### **Java**

solution/0500-0599/0589.N-ary Tree Preorder Traversal/README_EN.md

@@ -47,7 +47,25 @@
 ### **Python3**
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def preorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            res.append(root.val)
+            for i in root.children:
+                PO(i)
+        res=[]
+        PO(root)
+        return res
 ```
 
 ### **Java**

solution/0500-0599/0589.N-ary Tree Preorder Traversal/Solution.py

@@ -0,0 +1,19 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def preorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            res.append(root.val)
+            for i in root.children:
+                PO(i)
+        res=[]
+        PO(root)
+        return res

solution/0500-0599/0590.N-ary Tree Postorder Traversal/README.md

@@ -61,7 +61,28 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+class Solution:
+    def postorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            if root==None:
+                return res
+            else:
+                for i in root.children:
+                    PO(i)
+                    res.append(i.val)
+        res=[]
+        PO(root)
+        res.append(root.val)
+        return res
 ```
 
 ### **Java**

solution/0500-0599/0590.N-ary Tree Postorder Traversal/README_EN.md

@@ -43,7 +43,29 @@
 ### **Python3**
 
 ```python
-
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def postorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            if root==None:
+                return res
+            else:
+                for i in root.children:
+                    PO(i)
+                    res.append(i.val)
+        res=[]
+        PO(root)
+        res.append(root.val)
+        return res
 ```
 
 ### **Java**

solution/0500-0599/0590.N-ary Tree Postorder Traversal/Solution.py

@@ -0,0 +1,23 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, children=None):
+        self.val = val
+        self.children = children
+"""
+
+class Solution:
+    def postorder(self, root: 'Node') -> List[int]:
+        if not root:
+            return []
+        def PO(root):
+            if root==None:
+                return res
+            else:
+                for i in root.children:
+                    PO(i)
+                    res.append(i.val)
+        res=[]
+        PO(root)
+        res.append(root.val)
+        return res

solution/0900-0999/0997.Find the Town Judge/README.md

@@ -75,7 +75,22 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findJudge(self, n: int, trust: List[List[int]]) -> int:
+        if n == 1 and len(trust) == 0:
+            return 1
+        dic = {}
+        values = set()
+        for i in trust:
+            values.add(i[0])
+            if i[1] in dic:
+                dic[i[1]].append(i[0])
+            else: dic[i[1]] = [i[0]]
+
+        for key, value in dic.items():
+            if len(dic[key]) == n-1 and key not in values:
+                return key
+        return -1
 ```
 
 ### **Java**

solution/0900-0999/0997.Find the Town Judge/README_EN.md

@@ -84,7 +84,22 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findJudge(self, n: int, trust: List[List[int]]) -> int:
+        if n == 1 and len(trust) == 0:
+            return 1
+        dic = {}
+        values = set()
+        for i in trust:
+            values.add(i[0])
+            if i[1] in dic:
+                dic[i[1]].append(i[0])
+            else: dic[i[1]] = [i[0]]
+
+        for key, value in dic.items():
+            if len(dic[key]) == n-1 and key not in values:
+                return key
+        return -1
 ```
 
 ### **Java**

solution/0900-0999/0997.Find the Town Judge/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def findJudge(self, n: int, trust: List[List[int]]) -> int:
+        if n == 1 and len(trust) == 0:
+            return 1
+        dic = {}
+        values = set()
+        for i in trust:
+            values.add(i[0])
+            if i[1] in dic:
+                dic[i[1]].append(i[0])
+            else: dic[i[1]] = [i[0]]
+
+        for key, value in dic.items():
+            if len(dic[key]) == n-1 and key not in values:
+                return k

solution/1700-1799/1791.Find Center of Star Graph/README.md

@@ -52,7 +52,9 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findCenter(self, edges: List[List[int]]) -> int:
+        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1]
 ```
 
 ### **Java**

solution/1700-1799/1791.Find Center of Star Graph/README_EN.md

@@ -66,7 +66,9 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findCenter(self, edges: List[List[int]]) -> int:
+        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1]
 ```
 
 ### **Java**

solution/1700-1799/1791.Find Center of Star Graph/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def findCenter(self, edges: List[List[int]]) -> int:
+        return edges[0][0] if edges[0][0]==edges[1][0] or edges[0][0]==edges[1][1] else edges[0][1]