leetcode 005 —— Longest Palindromic Substring
来源:互联网 发布:淘宝小女孩子长裙礼服 编辑:程序博客网 时间:2024/05/22 23:06
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.
从每个位置,向两边开始扫描。
</pre><pre name="code" class="cpp">class Solution {public: string find_longest(string s,int c1,int c2){ int left=c1; int right=c2; while(s[left]==s[right]&&left>=0&&right<(int)s.size()){ left--; right++; } return s.substr(left+1,right-left-1); } string longestPalindrome(string s) { string longest=s.substr(0,1); int len=s.size(); for(int i=0;i<len-1;i++){ string sub1=find_longest(s,i,i); if(sub1.size()>longest.size()) longest=sub1; string sub2=find_longest(s,i,i+1); if(sub2.size()>longest.size()) longest=sub2; } return longest; } };
0 0
- leetcode 005 —— 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——5. Longest Palindromic Substring
- Leetcode——5. Longest Palindromic Substring
- leetcode 5—— Longest Palindromic Substring
- leetcode-005:Longest Palindromic Substring
- LeetCode-005 Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- [LeetCode]-005-Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- 005 Longest Palindromic Substring [Leetcode]
- [LeetCode]005-Longest Palindromic Substring
- LeetCode 005 Longest Palindromic Substring
- AsyncTask和Handler的优缺点比较
- Android初学习 - ProgressBar控件的简单说明
- Jedis2.4.2链接池配置注释
- 黑马程序员_日记49_泛型定义在类上
- (12)mysql中的光标
- leetcode 005 —— Longest Palindromic Substring
- cocos2d-x安装配置与示例程序运行
- mac下配置xampp+thinkphp解决方案
- Java 服务端接收多图上传
- SIP中的DNS过程
- Xcode编译Undefined symbols for architecture xxx 错误总结
- 第六周项目4:成员函数,友元函数和一般函数有区别
- Dos命令查看端口占用及关闭进程
- qt网络编程