LeetCode之Longest Palindromic Substring
来源:互联网 发布:淘宝代金券最多 编辑:程序博客网 时间:2024/06/07 02:12
/*暴力法:以每个元素为中心,左右扩展,找到以其为中心的最大回文串*/class Solution {public: string longestPalindrome(string s) { if(s.size() < 2) return s;//字符串数小于2,都为回文串 int count(-1); int left, right; for(int i = 0; i < s.size(); ++i){ int l, r; //1.以s[i]为中心,左右展开 l = i - 1; r = i + 1; while(l >= 0 && r < s.size() && s[l] == s[r]){ --l; ++r; } ++l; --r; if(count < r-l+1){ count = r-l+1; left = l; right = r; } //2.以s[i]以及s[i]后面的元素作为中心,左右展开 l = i; r = i + 1; while(l >= 0 && r < s.size() && s[l] == s[r]){ --l; ++r; } ++l; --r; if(count < r-l+1){ count = r-l+1; left = l; right = r; } } return s.substr(left, right - left + 1); }};
0 0
- leetcode之Longest Palindromic Substring
- LeetCode之Longest Palindromic Substring
- LeetCode之Longest Palindromic Substring
- 【Leetcode】之Longest Palindromic Substring
- LeetCode之Longest Palindromic Substring
- leetcode之longest palindromic substring
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- LeetCode Longest Palindromic Substring
- PortQry
- Android Busybox 下的adb,linux shell命令整理备忘 (2012-03-06 21:41:27)
- ORA-06553: PLS-801: 内部错误 [56319]
- 1012. 数字分类 (20)
- 哈夫曼树与哈夫曼编码
- LeetCode之Longest Palindromic Substring
- ListView设置emptyView的限制
- Hadoop中两表JOIN的处理方法
- DragonFlow导读(by quqi99)
- 前端优化:DNS预解析提升页面速度
- 【组合】Bzoj3142 数列[HNOI2013]
- Stanford UFLDL教程 池化Pooling
- 黑马day11 装饰类
- 程序员必须知道的8大排序和3大查找