5. Longest Palindromic Substring
来源:互联网 发布:游戏变速器源码 编辑:程序博客网 时间:2024/05/18 00:30
/*算法思想:本算法的一次判断每个字符的前后回文的长度,选取最大的那个输出;其中,start记录最长字符串的初始位置,*/class Solution {public: string longestPalindrome(string s) { if (s.empty())return "";if (s.size() == 1)return s;int start = 0, maxsub = 0;//stsrt记录最终的最长子串的起始位置,maxsub记录最长的长度for (int i = 0; i < s.size(); i++){int j = i, k = i;//j记录子串的开始位置,k记录子串结束的位置;while (k < s.size() && s[k] == s[k + 1])//如果出现相同的字符k++;while (k<s.size() && j>0 && s[j - 1] == s[k + 1]){j--;k++;}if (maxsub < k - j + 1){start = j;maxsub = k - j + 1;}}return s.substr(start, maxsub); }};
0 0
- 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
- Linux dd命令
- Ping程序
- postgresql上安装sysbench-0.5
- String的其他方法
- 二叉树的最小深度
- 5. Longest Palindromic Substring
- 图的遍历(BFS+DFS)
- Maven错误
- 安装 android studio创建工程运行报错 -- 常见的三个问题
- Mysql学习笔记(七):用MySQLWorkBench创建数据库和模型
- JVM监控与调优
- watch embedded binary's bundle identifier is not prefixed with the parent app's bundle identifier.
- Codeforces 672A(implementation)
- xPredIntraAng