Longest Palindromic Substring Java
来源:互联网 发布:ubuntu防火墙关闭 编辑:程序博客网 时间:2024/06/07 04:42
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.
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; }
0 0
- Longest Palindromic Substring Java
- Longest Palindromic Substring (Java)
- [Leetcode] Longest Palindromic Substring (Java)
- Longest Palindromic Substring leetcode java
- [Java]LeetCode5 Longest Palindromic Substring
- [LeetCode][Java]Longest Palindromic Substring
- LeetCode-Longest Palindromic subString(java)
- LeetCode : Longest Palindromic Substring [java]
- leetcode:Longest Palindromic Substring java
- [LeetCode]Longest Palindromic Substring(Java)
- [LeetCode] Longest Palindromic Substring(java)
- leetcode Longest Palindromic Substring(Java)
- Java Longest Palindromic Substring(最长回文字符串)
- Java Longest Palindromic Substring(最长回文字符串)
- 【leetcode with java】5 Longest Palindromic Substring
- java Longest Palindromic Substring(最长回文字符串)
- [leetcode-5]Longest Palindromic Substring(java)
- leetcode 005 Longest Palindromic Substring(java)
- 360双内核浏览器修改默认模式
- osgi web开发遗留问题记录
- 三种保证URL地址可信的加密方式
- Android自定义控件——仿淘宝、网易、彩票等广告条、Banner的制作
- socket连接和http连接的区别
- Longest Palindromic Substring Java
- spinbox HTML源码
- nyoj 366 D的小L
- android中@+id 与@string的使用
- nand flash与nor flash区别
- 运行vs2012出现unknown hard error
- LeetCode Solutions : Path Sum I & II
- Ant 多渠道 多项目应用library 打包Android项目遇到问题总结
- chrome DevTool For Improving web app performance