Longest Palindromic Substring
来源:互联网 发布:mac中的照片在哪里 编辑:程序博客网 时间:2024/05/22 16:54
题目:
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
动态规划
动态规划都要有:1)一个标志位flag;2)双层循环;3)判断是否最优,如max等;
代码:
class Solution {public: string longestPalindrome(string s) { int len=s.size(); bool flag[len][len]; int sstart=0; int send=0; int max=1; for(int i=0;i<len;i++) { for(int j=0;j<len;j++) { if(i>=j) flag[i][j]=true; else flag[i][j]=false; } } for(int j=1;j<len;j++) { for(int i=0;i<j;i++) { if(s[i]==s[j]) { flag[i][j]=flag[i+1][j-1]; if(flag[i][j]==true && j-i+1>max) { max=j-i+1; sstart=i; send=j; } } else flag[i][j]=false; } } string result=s.substr(sstart,max); return result; }};
0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- Longest Palindromic substring
- [LeetCode] Longest Palindromic Substring
- LeetCode5:Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- 使用两个stack对一个stack的内容进行反转
- shell数组
- Android消息提示:AlertDialog、Toast、Notification的使用
- POJ2398——Toy Storage
- 策略模式题
- Longest Palindromic Substring
- hdu 3460 Ancient Printer 字典树
- POJ---3278-Catch That Cow(BFS/deque)
- python 线程,GIL 和 ctypes
- 买票找零
- windows7下搭建robot framework环境指导
- CompressCU 函数
- 算法导论 13章 红黑树
- 《CTCI》3.5 用两个栈实现队列