leetcode--Longest Palindromic Subsequence
来源:互联网 发布:阿里云 aws对比 编辑:程序博客网 时间:2024/06/06 18:45
题目
Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000
bbbab -> 4(bbbb)
思路:动态规划
dp[i][j] 表示String(i,j)子串里子最大子序列的长度
子问题求解如下;
dp[i][i] = 1;
if String(i) == String(j) dp[i][j] = dp[i+1][j-1];
if String(i) != String(j) dp[i][j] = max(dp[i][j-1],dp[i+1][j]);
代码实现思路:
dp =
0 0 0 0 0 ->1 0 0 0 0 ->1 * 0 0 0 ->1 * * 0 0 ->1 * * * 0 ->1 * * * *
0 0 0 0 0 ->0 1 0 0 0 ->0 1 * 0 0 ->0 1 * * 0 ->0 1 * * * ->0 1 * * *
0 0 0 0 0 ->0 0 1 0 0 ->0 0 1 * 0 ->0 0 1 * * ->0 0 1 * * ->0 0 1 * *
0 0 0 0 0 ->0 0 0 1 0 ->0 0 0 1 * ->0 0 0 1 * ->0 0 0 1 * ->0 0 0 1 *
0 0 0 0 0 ->0 0 0 0 1 ->0 0 0 0 1 ->0 0 0 0 1->0 0 0 0 1 ->0 0 0 0 1
代码:
public int longestPalindromeSubseq(String s) { if(s.length() == 0) return 0; int[][] dp = new int[s.length()][s.length()]; for(int i = 0;i < s.length();i++){ for(int j = i;j < s.length();j++){ if(i == 0) dp[j-i][j] = 1; else if(s.charAt(j-i) == s.charAt(j)) dp[j-i][j] = dp[j-i+1][j-1] + 2; else dp[j-i][j] = Integer.max(dp[j-i][j-1], dp[j-i+1][j]); } } return dp[0][s.length()-1]; }
- [LeetCode]Longest Palindromic Subsequence
- LeetCode- Longest Palindromic Subsequence
- leetcode--Longest Palindromic Subsequence
- Leetcode- Longest Palindromic Subsequence
- LeetCode 516. Longest Palindromic Subsequence
- [leetcode]516. Longest Palindromic Subsequence
- Leetcode-516-Longest Palindromic Subsequence
- leetcode 516. Longest Palindromic Subsequence
- [LeetCode]516. Longest Palindromic Subsequence
- Leetcode-516. Longest Palindromic Subsequence
- LeetCode 516. Longest Palindromic Subsequence
- leetcode-516. Longest Palindromic Subsequence
- leetcode 516. Longest Palindromic Subsequence
- Leetcode 516. Longest Palindromic Subsequence
- [LeetCode OJ]Longest Palindromic Subsequence
- Leetcode 516. Longest Palindromic Subsequence
- LeetCode 516. Longest Palindromic Subsequence
- LeetCode 516. Longest Palindromic Subsequence
- caffe上手:如何导出caffemodel参数
- Map四种获取key和value值的方法,以及对map中的元素排序(转载)
- 导入excel
- Java面向对象习题
- 深入剖析ThreadLocal
- leetcode--Longest Palindromic Subsequence
- 最佳股票交易时机
- Ethernet,TCP,IP协议简介
- 【安全】Android O 中的 Seccomp 过滤器
- 属性动画
- ViewPager+Fragment的实现及禁止滑动
- 移动web问题小结
- struts之国际化的实现操作
- 第十二节、css进阶:消除未使用的css