[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
Question：
Given a string s, return the longest palindromic substring in s.
Example1：
Input: s = "babad"
Output: "bab"
Explanation: "aba" is also a valid answer.
Example2:
Input: s = "cbbd"
Output: "bb"
Mentality:
这道题可以用中心扩散法来解，依次判断我们子串所能达到的最远边距。但是要注意：我们的子串分为奇数长度和偶数长度两种情况，根据这两种情况，我们要做不同的处理。
Code:
class Solution: def longestPalindrome(self, s: str) -> str: start = 0 end = 0
for i in range(len(s)): left1, right1 = self.expendaroundcenter(s, i, i) left2,
right2 = self.expendaroundcenter(s, i, i+1) if right1 - left1 > end - start:
start, end = left1, right1 if right2 - left2 > end - start: start, end = left2,
right2 return s[start: end + 1] def expendaroundcenter(self, s, left, right):
while left >= 0 and right < len(s) and s[left] == s[right]: left -= 1 right +=
1 return left + 1, right - 1
Result:
可以发现，上述结果还存在可以优化的空间，于是我去学习了一下大佬们的代码，在这分享
Code:
class Solution: def longestPalindrome(self, s: str) -> str: res = '' for i in
range(len(s)): start = max(0, i-len(res)-1) temp = s[start:i+1] if temp ==
temp[::-1]: res = temp else: temp = temp[1:] if temp == temp[::-1]: res = temp
return res
Result：
快了将近十倍。。但是我感觉思路差不多，他的判断很巧妙。
