leetcode--Longest Palindromic Substring
来源：互联网 发布：说谎家 mmd动作数据 编辑：程序博客网 时间：2024/06/06 12:47
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length ofS is 1000, and there exists one unique longest palindromic substring.
public class Solution { public String longestPalindrome(String s) {boolean flag[][] = new boolean[s.length()][s.length()];//标记i到j之间的子串是否为回文int max = 0;int start = 0;aint end = 0;for(int i=0;i<s.length();i++){//单个字符为回文flag[i][i] = true;}for(int j=1;j<s.length();j++){for(int i=0;i<j;i++){if(s.charAt(i)==s.charAt(j)){//如果i,j上字符相同，也就是说第一个和最后一个相同；不相同就是可以判断不是回文了 if(i+1>j-1||flag[i+1][j-1])//如果i+1>j-1也就是i,j相邻，说明是回文，另外，如果i+1,j-1之间为回文，则判断为回文 flag[i][j] = true;if(flag[i][j]&&max<j-i+1){start = i;end = j;max = j-i+1;}}}}return s.substring(start, end+1); }} 0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- LeetCode Longest Palindromic Substring
- LeetCode - Longest Palindromic Substring
- LeetCode -- Longest Palindromic Substring
- LeetCode | Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- 文本框内容滚动(点击上下，文字上滚与下滚)
- mac ox 10.9 安装eclipse cpp launch failed binary not found
- 复选框全选反选
- win64位，PLSQL Developer64位的安装方法
- 表单验证
- leetcode--Longest Palindromic Substring
- js数组类型检测
- 取消sublime编辑的升级提示
- cookie
- C# Lock关键字
- win8.1安装masm32 SDK时出现kernel32.lib is missing
- Maximizing XOR 这么顺利地解决。。。
- N对数的排列问题（数论）
- 转载：fcntl与文件锁
