LeetCode#5 Longest Palindromic Substring
来源：互联网 发布：广州蓝盾怎么样 知乎 编辑：程序博客网 时间：2024/06/14 05:49
class Solution: # @param {string} s # @return {string} def longestPalindrome(self, s): lenS = len(s) maxLen = 0 maxStr = "" for i in range(0,lenS): l = r = i while l>=0 and r<lenS and s[l] == s[r]: l-=1 r+=1 l+=1 r-=1 if r - l >= maxLen: maxLen = r - l maxStr = s[l:r+1] l = i r = i+1 while l>=0 and r<lenS and s[l] == s[r]: l-=1 r+=1 l+=1 r-=1 if r - l >= maxLen: maxLen = r-l maxStr = s[l:r+1] return maxStr 0 0
- 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
- 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
- Longest Palindromic Substring leetcode 5
- leetcode 5 -- Longest Palindromic Substring
- 从源码看Spring bean 生命周期
- [MarsZ]程序猿谈大学之工作三年半的程序猿给大学童鞋的一些注释
- 在Ubuntu14.04上使用devstack安装OpenStack
- pow(x,y)函数的用法及实现算法
- map练习-Lexicon词典-anagram游戏
- LeetCode#5 Longest Palindromic Substring
- Error: “app_name” is not translated in af
- maven使用
- STM32学习笔记系列
- android中夸进程通讯的四中方法
- 网络-WinSocket-socket编程
- 三期_day09_信息+订单管理_II
- nodejs - 升级
- C++笔记（6）:结构体
