Longest Palindromic Substring Java
2014-09-15 16:22
204 查看
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.
Have you been asked this question in an interview?
Idea: Nested loop:
Outer loop: i start from back to front
inner loop: j start from i to the end
Stated more formally below:
Define P[i][j] ← true iff
the substring Si … Sj is a palindrome,that means
Si = Sj and P[i][j] ← ( P[ i+1, j-1 ]
otherwise false.
public static String longestPalindrome(String s) {
if(s==null || s.length()==0) return "";
int len=s.length();
boolean[][] palin=new boolean[len][len];
String res="";
int maxLen=0;
for(int i=len-1;i>=0;i--){
for(int j=i;j<len;j++){
System.out.println(i+"->"+s.charAt(i)+" => "+j +"->"+s.charAt(j));
//System.out.println();
if(s.charAt(i)==s.charAt(j) && (j-i<=2 || palin[i+1][j-1])){
palin[i][j]=true;
if(maxLen<j-i+1){
maxLen=j-i+1;
res=s.substring(i,j+1);
System.out.println("res: "+res);
}
}
}
}
return res;
}
palindromic substring.
Have you been asked this question in an interview?
Idea: Nested loop:
Outer loop: i start from back to front
inner loop: j start from i to the end
Stated more formally below:
Define P[i][j] ← true iff
the substring Si … Sj is a palindrome,that means
Si = Sj and P[i][j] ← ( P[ i+1, j-1 ]
otherwise false.
public static String longestPalindrome(String s) {
if(s==null || s.length()==0) return "";
int len=s.length();
boolean[][] palin=new boolean[len][len];
String res="";
int maxLen=0;
for(int i=len-1;i>=0;i--){
for(int j=i;j<len;j++){
System.out.println(i+"->"+s.charAt(i)+" => "+j +"->"+s.charAt(j));
//System.out.println();
if(s.charAt(i)==s.charAt(j) && (j-i<=2 || palin[i+1][j-1])){
palin[i][j]=true;
if(maxLen<j-i+1){
maxLen=j-i+1;
res=s.substring(i,j+1);
System.out.println("res: "+res);
}
}
}
}
return res;
}
相关文章推荐
- Java Longest Palindromic Substring(最长回文字符串)
- [LeetCode] 005. Longest Palindromic Substring (Medium) (C++/Java/Python)
- LeetCode-Longest Palindromic subString(java)
- leetcode: 5. Longest Palindromic Substring (java)
- LeetCode : Longest Palindromic Substring [java]
- Longest Palindromic Substring leetcode java
- [LeetCode][Java]Longest Palindromic Substring
- leetcode 5:Longest Palindromic Substring 三种解法的java实现源代码,以及详细讲解
- java Longest Palindromic Substring(最长回文字符串)
- leetcode-java-5. Longest Palindromic Substring
- Longest Palindromic Substring (Java)
- LeetCode 5 Longest Palindromic Substring(C,C++,Python,Java)
- leetcode 第五题 Longest Palindromic Substring (java)
- leetcode 005 Longest Palindromic Substring(java)
- Leetcode Solution of Longest Palindromic Substring in Java
- Longest Palindromic Substring leetcode java
- 【JAVA、C++】LeetCode 005 Longest Palindromic Substring
- Java [leetcode 5] Longest Palindromic Substring
- leetcode05- Longest Palindromic Substring之Java版本
- java常用算法之最长回文子串(Longest Palindromic Substring)