LeetCode: 5. Longest Palindromic Substring

class Solution { public: //動態規劃算法string longestPalindrome(string s) {int n = s.length();int longestBegin = 0;int maxLen = 1;bool table[1000][1000] = {false};for (int i = 0; i < n; i++) {table[i][i] = true;}//對角設為1for (int i = 0; i < n-1; i++) {if (s[i] == s[i+1]) {table[i][i+1] = true;start = i;maxLen = 2;}}//檢查是否存在"aa"這樣的for (int len = 3; len <= n; len++) {for (int i = 0; i < n-len+1; i++) {int j = i+len-1;if (s[i] == s[j] && table[i+1][j-1]) {table[i][j] = true;start = i;maxLen = len;}}}return s.substr(start, maxLen);} };

轉載于:https://www.cnblogs.com/guoyunzhe/p/5850465.html

創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的[LeetCode_5] Longest Palindromic Substring的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。