Longest Palindromic Substring
来源:互联网 发布:黄渤的唱功 知乎 编辑:程序博客网 时间:2024/05/21 11:35
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.
求最长回文字串,传说有o(n)解法 但我的也能过,
public class Solution { public String longestPalindrome(String s) { if (s.isEmpty()) {return null;}if (s.length() == 1) {return s;}String longest = s.substring(0, 1);for (int i = 0; i < s.length(); i++) {// get longest palindrome with center of iString tmp = helper(s, i, i);if (tmp.length() > longest.length()) {longest = tmp;}// get longest palindrome with center of i, i+1tmp = helper(s, i, i + 1);if (tmp.length() > longest.length()) {longest = tmp;}}return longest;}// Given a center, either one letter or two letter,// Find longest palindromepublic static String helper(String s, int begin, int end) {while (begin >= 0 && end <= s.length() - 1&& s.charAt(begin) == s.charAt(end)) {begin--;end++;}String subS = s.substring(begin + 1, end);return subS;} }
0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- Longest Palindromic substring
- [LeetCode] Longest Palindromic Substring
- LeetCode5:Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- Longest Palindromic Substring
- Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- oracle union 用法总结
- 探索Java应用程序的国际化支持
- J2EE学习(Hibernate的工作原理)
- iOS开发,图片太多占内存太大如何解决
- Hadoop 文件块大小设置
- Longest Palindromic Substring
- Spring MVC的HTTP请求信息转换器HttpMessageConverter
- iOS自定义控件-动态标签展示
- jquery数字滚动
- COM简介
- 交换排序
- Docker应用的监控
- Java数组取交集
- android通过电源管理保持屏幕常亮