Update README.md

solution/1900-1999/1960.Maximum Product of the Length of Two Palindromic Substrings/README.md

@@ -68,7 +68,6 @@ tags:
 #### Python3
 
 ```python
-
 class Solution:
     def maxProduct(self, s: str) -> int:
         n = len(s)
@@ -103,13 +102,11 @@ class Solution:
             suffix[~i] = max(suffix[~i], suffix[~i + 1])
 
         return max(prefix[i - 1] * suffix[i] for i in range(1, n))
-
 ```
 
 #### Java
 
 ```java
-
 class Solution {
     public long maxProduct(String s) {
         int n = s.length();
@@ -163,13 +160,11 @@ class Solution {
         return P;
     }
 }
-
 ```
 
 #### C++
 
 ```cpp
-
 class Solution {
 public:
     long long maxProduct(string s) {
@@ -207,13 +202,11 @@ public:
         return res;
     }
 };
-
 ```
 
 #### Go
 
 ```go
-
 func maxProduct(s string) int64 {
 	n := len(s)
 	hlen := make([]int, n)
@@ -271,21 +264,6 @@ func maxProduct(s string) int64 {
 
 	return res
 }
-
-func max(a, b int) int {
-	if a > b {
-		return a
-	}
-	return b
-}
-
-func min(a, b int) int {
-	if a < b {
-		return a
-	}
-	return b
-}
-
 ```
 
 <!-- tabs:end -->