【Leetcode】 Longest Palindromic Substring
来源：互联网 发布：c语言随机数 编辑：程序博客网 时间：2024/06/03 19:31
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: # @return a string def longestPalindrome(self, s): if len(s)==0: return 0 maxLen=1 start=0 for i in xrange(len(s)): if i-maxLen >=1 and s[i-maxLen-1:i+1]==s[i-maxLen-1:i+1][::-1]: start=i-maxLen-1 maxLen+=2 continue if i-maxLen >=0 and s[i-maxLen:i+1]==s[i-maxLen:i+1][::-1]: start=i-maxLen maxLen+=1 return s[start:start+maxLen]
阅读全文
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
- Longest Palindromic Substring leetcode
- 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
- IE11开发者工具
- 【Leetcode】Median of Two Sorted Arrays
- Spring中集合（List，Set，Map）的配置和简单使用（一）
- 内存泄漏
- 自学爬虫程序-1、最简单爬虫代码
- 【Leetcode】 Longest Palindromic Substring
- MQ消息队列应用
- DehazeNet读后总结
- hash的基本原理与实现
- Android系统服务之LightsService实现架构
- 开始我的程序员之路
- 去掉字符串前后空白
- 五种方式让你在java中读取properties文件内容不再是难题
- Hive安装
