LeeCode Longest Palindromic Substring
来源：互联网 发布：加油好男儿现状 知乎 编辑：程序博客网 时间：2024/06/01 23:54
public class Solution { public String longestPalindrome(String s) { boolean table[][] = new boolean[s.length()][s.length()]; int resI = 0; int len = 1; int maxLen = 1; for(int i =0;i<s.length();i++){ table[i][i] = true; } for(int i =0;i<s.length()-1;i++) if( s.charAt(i) == s.charAt(i+1)){ table[i][i+1] =true; if(maxLen < 2){ maxLen = 2; resI = i; } } for (len = 3; len <= s.length(); len++) { for (int i = 0; i < s.length()-len+1; i++) { int j = i+len-1; if (s.charAt(i) == s.charAt(j) && table[i+1][j-1]) { table[i][j] = true; resI = i; maxLen = len; } } } return s.substring(resI, resI+maxLen); }}阅读全文
0 0
- LeeCode Longest Palindromic Substring
- leecode 5. Longest Palindromic Substring
- 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
- 欢迎使用CSDN-markdown编辑器
- JVM学习笔记（2）-JVM部分异常情况
- 最小生成树的应用
- ThinkPHP操作
- eclispe下导入tomcat8源码
- LeeCode Longest Palindromic Substring
- tensorflow入门教程之CIFAR-10源代码
- 深入浅出php socket编程
- 虚拟币开发专题(市面上山寨币钱包开发对比)
- 1.4 class文件中的字段表集合--field字段在class文件中是怎样组织的
- cvte-c++-笔试2
- c++实现装饰器模式
- 文章标题 基础RMQ
- STL算法分析
