Added Solution for 1900. The Earliest and Latest Rounds Where Players Compete. and updated the code in README_EN and README

solution/1900-1999/1900.The Earliest and Latest Rounds Where Players Compete/README.md

@@ -74,6 +74,34 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Solution:
+    def earliestAndLatest(
+        self, n: int, firstPlayer: int, secondPlayer: int
+    ) -> List[int]:
+        # dp[i][j][k] := (earliest, latest) pair w/ firstPlayer is i-th player from
+        # Front, secondPlayer is j-th player from end, and there're k people
+        @functools.lru_cache(None)
+        def dp(l: int, r: int, k: int) -> List[int]:
+            if l == r:
+                return [1, 1]
+            if l > r:
+                return dp(r, l, k)
+
+            a = math.inf
+            b = -math.inf
+
+            # Enumerate all possible positions
+            for i in range(1, l + 1):
+                for j in range(l - i + 1, r - i + 1):
+                    if not l + r - k // 2 <= i + j <= (k + 1) // 2:
+                        continue
+                    x, y = dp(i, j, (k + 1) // 2)
+                    a = min(a, x + 1)
+                    b = max(b, y + 1)
+
+            return [a, b]
+
+        return dp(firstPlayer, n - secondPlayer + 1, n)
 
 ```
 

solution/1900-1999/1900.The Earliest and Latest Rounds Where Players Compete/README_EN.md

@@ -68,6 +68,34 @@ There is no way to make them compete in any other round.
 ### **Python3**
 
 ```python
+class Solution:
+    def earliestAndLatest(
+        self, n: int, firstPlayer: int, secondPlayer: int
+    ) -> List[int]:
+        # dp[i][j][k] := (earliest, latest) pair w/ firstPlayer is i-th player from
+        # Front, secondPlayer is j-th player from end, and there're k people
+        @functools.lru_cache(None)
+        def dp(l: int, r: int, k: int) -> List[int]:
+            if l == r:
+                return [1, 1]
+            if l > r:
+                return dp(r, l, k)
+
+            a = math.inf
+            b = -math.inf
+
+            # Enumerate all possible positions
+            for i in range(1, l + 1):
+                for j in range(l - i + 1, r - i + 1):
+                    if not l + r - k // 2 <= i + j <= (k + 1) // 2:
+                        continue
+                    x, y = dp(i, j, (k + 1) // 2)
+                    a = min(a, x + 1)
+                    b = max(b, y + 1)
+
+            return [a, b]
+
+        return dp(firstPlayer, n - secondPlayer + 1, n)
 
 ```
 

solution/1900-1999/1900.The Earliest and Latest Rounds Where Players Compete/Solution.py

@@ -0,0 +1,28 @@
+class Solution:
+    def earliestAndLatest(
+        self, n: int, firstPlayer: int, secondPlayer: int
+    ) -> List[int]:
+        # dp[i][j][k] := (earliest, latest) pair w/ firstPlayer is i-th player from
+        # Front, secondPlayer is j-th player from end, and there're k people
+        @functools.lru_cache(None)
+        def dp(l: int, r: int, k: int) -> List[int]:
+            if l == r:
+                return [1, 1]
+            if l > r:
+                return dp(r, l, k)
+
+            a = math.inf
+            b = -math.inf
+
+            # Enumerate all possible positions
+            for i in range(1, l + 1):
+                for j in range(l - i + 1, r - i + 1):
+                    if not l + r - k // 2 <= i + j <= (k + 1) // 2:
+                        continue
+                    x, y = dp(i, j, (k + 1) // 2)
+                    a = min(a, x + 1)
+                    b = max(b, y + 1)
+
+            return [a, b]
+
+        return dp(firstPlayer, n - secondPlayer + 1, n)