Leetcode 5. Longest Palindromic Substring (Medium) (cpp)
来源：互联网 发布：java web有什么好书 编辑：程序博客网 时间：2024/06/09 20:36
Leetcode 5. Longest Palindromic Substring (Medium) (cpp)
Tag: String
Difficulty: Medium
/*5. Longest Palindromic Substring (Medium)Given a string S, find the longest palindromic substring in S. You may assume that the maximumlength of S is 1000, and there exists one unique longest palindromic substring.*/class Solution {public:string longestPalindrome(string s) {string res;int _size = s.length(), l_max = 0, len_max = 0, l, r;for (int i = 0; i < _size && _size - i > len_max / 2;) {l = r = i;while (r < _size - 1 && s[r] == s[r + 1]) {r++;}i = r + 1;while (l > 0 && r < _size - 1 && s[l - 1] == s[r + 1]) {l--;r++;}if (r - l + 1 > len_max) {len_max = r - l + 1;l_max = l;}}return s.substr(l_max, len_max);}};
0 0
- Leetcode 5. Longest Palindromic Substring (Medium) (cpp)
- (Leetcode)5. Longest Palindromic Substring(medium)
- 5. Longest Palindromic Substring Medium
- 题解——Leetcode 5. Longest Palindromic Substring 难度：Medium
- [Leetcode 5, Medium] Longest Palindromic Substring
- 【Leetcode】(5)Longest Palindromic Substring(Medium)
- Longest Palindromic Substring(leetcode medium algorithm problem)
- leetcode 日经贴，Cpp code -Longest Palindromic Substring
- 5. Longest Palindromic Substring （Medium）
- LeetCode 5. Longest Palindromic Substring
- LeetCode --- 5. Longest Palindromic Substring
- LeetCode 5.Longest Palindromic Substring
- [Leetcode] 5. Longest Palindromic Substring
- [LeetCode]5.Longest Palindromic Substring
- [leetcode] 5. Longest Palindromic Substring
- LeetCode-5. Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- leetcode 5. Longest Palindromic Substring
- 小笔记
- 35 个快速学习编程的好去处
- Java注解
- UML—小总结
- 一些术语
- Leetcode 5. Longest Palindromic Substring (Medium) (cpp)
- Java的比较和排序
- SharedPreferences
- ☆HDU 1024 Max Sum Plus Plus 绝对能看懂得题解（难题，多个子段和的和最大）
- Java String, StringBuffer和StringBuilder实例
- 纯CSS实现多级导航栏。
- groupId Lombok 安装、入门 - 消除冗长的 java 代码
- Java异常处理实例教程
- Java泛型实例
