5. Longest Palindromic Substring
来源:互联网 发布:淘宝忘记密码怎么办 编辑:程序博客网 时间:2024/06/07 13:40
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Example:
Input: "babad"Output: "bab"Note: "aba" is also a valid answer.
Example:
Input: "cbbd"Output: "bb"
题意:最长回文字符串,用一个二维矩阵来表示,最初从对角线(左上到右下,代表单个字符)开始,然后依次往上进行对角线(两个字符,多个字符)处理。
class Solution {public: string longestPalindrome(string s) { int len = s.length(); int maxLen = 0; int longestBegin = 0; vector<vector<bool> > vec(len, vector<bool>(len, false)); for(int i = 0; i < len; ++i){//单个字符 vec[i][i] = true; maxLen = 1; longestBegin = i; } for(int i = 0; i < len - 1; ++i){//相邻两个相等的字符 if(s[i] == s[i + 1]){ maxLen = 2; longestBegin = i; vec[i][i + 1] = true; } } for(int l = 3; l <= len; ++l){ for(int i = 0; i < len - l + 1; ++i){ int j = i + l - 1; if(s[i] == s[j] && vec[i + 1][j - 1]){ maxLen = l; longestBegin = i; vec[i][j] = true; } } } return s.substr(longestBegin, maxLen); }};
阅读全文
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
- android开发中selinux的影响
- 实战hadoop海量数据处理系列05 : 实现点击流日志的数据清洗模块
- java抽象类、接口特性
- 公共数据库介绍~OECD经合组织数据库
- Java匿名内部类
- 5. Longest Palindromic Substring
- 【Leetcode】 66. Plus One
- 判断两个IP是否属于同一子网(没有判断掩码或ip是否合法,测试通过牛客)
- JavaScript 中 String 的常用函数
- MySQL(二)
- 交叉验证与网格搜索
- Eclipse之如何快速查看抽象函数实现
- Fire Game
- Git 操作命令