【Leetcode】Longest palindrome substring
来源:互联网 发布:linux更新内核 boot 编辑:程序博客网 时间:2024/04/30 15:53
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.
——————————————————————
写出来很简单,足够低的complexity通过LC却很难。直到看到这位大神的代码,简单清晰效率高,orz。
public class Solution { int lo, maxLen; public String longestPalindrome(String s) { int len = s.length(); if (len < 2) return s; for (int i = 0; i < len-1; i++) { extendPalindrome(s, i, i); //assume odd length, try to extend Palindrome as possible extendPalindrome(s, i, i+1); //assume even length. } return s.substring(lo, lo + maxLen);}private void extendPalindrome(String s, int j, int k) { while (j >= 0 && k < s.length() && s.charAt(j) == s.charAt(k)) { j--; k++; } if (maxLen < k - j - 1) { lo = j + 1; maxLen = k - j - 1; }}}
0 0
- 【LeetCode】 Longest Palindrome Substring
- 【Leetcode】Longest Palindrome Substring
- 【Leetcode】Longest palindrome substring
- leetcode 5: Longest Palindrome Substring
- [LeetCode] Longest Palindrome Substring 详细分析
- [LeetCode] 4. Longest Palindrome Substring 分析+代码
- longest Palindrome substring
- Longest palindrome substring
- Longest Palindrome Substring
- 5 longest palindrome substring
- longest palindrome substring
- leetcode Longgest Palindrome Substring
- 【Leetcode】Longest Palindrome
- 【Leetcode】409. Longest Palindrome
- [LeetCode]409. Longest Palindrome
- LeetCode[409] Longest Palindrome
- LeetCode 409. Longest Palindrome
- [LeetCode]--409. Longest Palindrome
- 8.5.2 例1:从前一行中返回一个值
- 8.6 First_value和Last_value
- 8.6.1 例子:使用First_value来计算最大值
- 8.8.1 执行计划
- 8.8.2 谓语
- 【Leetcode】Longest palindrome substring
- 8.9.1 动态SQL
- 8.9.2 嵌套分析函数
- 8.10 组织行为
- ubuntu下部署eclipse集成hadoop\android\web\GCC开发环境小记
- 8.11 小结
- C# List使用总结
- 【点分治】BZOJ 2599:[IOI2011]Race
- 9.2 通过Model子句进行跨行引用