From 811082be57e4ad2f0c94933921cb822c501ae4f1 Mon Sep 17 00:00:00 2001
From: LiangDazhu <42199191+LiangDazhu@users.noreply.github.com>
Date: Tue, 10 Aug 2021 19:10:16 +0800
Subject: [PATCH] =?UTF-8?q?Update=200005.=E6=9C=80=E9=95=BF=E5=9B=9E?=
 =?UTF-8?q?=E6=96=87=E5=AD=90=E4=B8=B2.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Added python version code
---
 problems/0005.最长回文子串.md | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/problems/0005.最长回文子串.md b/problems/0005.最长回文子串.md
index 0063b358..803170f6 100644
--- a/problems/0005.最长回文子串.md
+++ b/problems/0005.最长回文子串.md
@@ -270,6 +270,23 @@ public:
 ## Python
 
 ```python
+class Solution:
+    def longestPalindrome(self, s: str) -> str:
+        dp = [[False] * len(s) for _ in range(len(s))]
+        maxlenth = 0
+        left = 0
+        right = 0
+        for i in range(len(s) - 1, -1, -1):
+            for j in range(i, len(s)):
+                if s[j] == s[i]:
+                    if j - i <= 1 or dp[i + 1][j - 1]:
+                        dp[i][j] = True
+                if dp[i][j] and j - i + 1 > maxlenth:
+                    maxlenth = j - i + 1
+                    left = i
+                    right = j
+        return s[left:right + 1]
+
 ```
 
 ## Go