5. Longest Palindromic Substring
来源:互联网 发布:淘宝商城帐篷 编辑:程序博客网 时间:2024/06/09 15:04
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.
class Solution {
public:
string longestPalindrome(string s) {
int len = s.length(), max = 1, s_start = 0, s_end = 0;
bool flag[len][len];
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;
s_start = i;
s_end = j;
}
}
else flag[i][j] = false;
}
return s.substr(s_start, max);
}
};
- 5.Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5.Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5.Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5.Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- 5. Longest Palindromic Substring
- mysql查询对大小写不敏感的问题
- Deep Learning-------流行网络框架DIY版本(易于理解)
- 【Java每日一题】20161026
- linux下使用screen和ping命令对网络质量进行监控
- [Openwrt 项目开发笔记]:Openwrt平台搭建(一)补遗
- 5. Longest Palindromic Substring
- 关于DUBBO服务的XML配置文件报错的问题
- ImageView加边框
- tomcat的reload原理
- shell 脚本中while 循环只执行一次的问题
- linux包含权限压缩文件与解压缩
- 飞思卡尔K22调试FXOS8700加速度和电子罗盘
- [Openwrt 项目开发笔记]:Openwrt必要设置(二)
- 训练神经网络的五大算法