[{"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}]
暴力 o(n3)
中心拓展法o(n2)
动态规划o(n2)
动态规划思路
根据一名分析回文串如果两边字符相同，那么必须中间是回文子串，整体才会回文
既
且二维遍历，ij确定，子串也就确定，但由于需要先计算出i+1,j-1,所以我们的遍历顺序需要从下往上，既i从大到小，j从小到大，j最小从i开始取
class Solution { public String longestPalindrome(String s) { int len =
s.length(); int ans = 0; int j = 0,i=0; boolean[][] st = new
boolean[1050][1050]; int start = 0,end = 0; for( i=len-1;i>=0;i--) { for(
j=i;j<len;j++) { if(s.charAt(i) == s.charAt(j)){ if((j-i)<=1){ st[i][j] = true;
} else if(st[i+1][j-1]){ st[i][j] = true; } } if(st[i][j]&&(ans<(j-i+1))){ ans
= j-i+1; end = j; start = i; } } } return s.substring(start,end+1); } }
