最长子序列回文问题,Longest Palindromic Subsequence
来源:互联网 发布:网络教育怎么样 编辑:程序博客网 时间:2024/06/11 20:21
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.
Example 1:
Input:
"bbbab"Output:
4One possible longest palindromic subsequence is "bbbb".
Example 2:
Input:
"cbbd"Output:
2
One possible longest palindromic subsequence is "bb".
public class longestsubPalindrome {public static int longsubPalin(String s) { //求最长回文子序列长度char[] ch = s.toCharArray();int[][] dp = new int[ch.length][ch.length];for (int i = 0; i < ch.length; i++) {dp[i][i] = 1;}for (int i = 1; i < ch.length; i++) {for (int j = i - 1; j >= 0; j--) {if (ch[i] == ch[j])dp[j][i] = dp[j + 1][i - 1] + 2;else {dp[j][i] = Math.max(dp[j + 1][i], dp[j][i - 1]);}}}return dp[0][ch.length - 1];}public static String subPalin(String s) { //求最长子序列对应长度的字符串char[] ch = s.toCharArray();String[][] dp = new String[ch.length][ch.length];for(int i=0;i<ch.length;i++){for(int j=0;j<ch.length;j++){dp[i][j]="";}}for (int i = 0; i < ch.length; i++) {dp[i][i] = dp[i][i]+ch[i];}for (int i = 1; i < ch.length; i++) {for (int j = i - 1; j >= 0; j--) {if (ch[i] == ch[j]) {dp[j][i] = dp[j + 1][i - 1]+ch[j];dp[j][i]=ch[j]+dp[j][i];} else {dp[j][i] = dp[j + 1][i].length()>dp[j][i - 1].length()?dp[j + 1][i]:dp[j][i - 1];}}}return dp[0][ch.length - 1].toString();}public static void main(String[] args) {System.out.println(longsubPalin("cbbd"));System.out.println(subPalin("cbbd"));System.out.println(longsubPalin("bbabb"));System.out.println(subPalin("bbabb"));}}
阅读全文
0 0
- 最长子序列回文问题,Longest Palindromic Subsequence
- [LeetCode] Longest Palindromic Subsequence 最长回文子序列
- LeetCode 516. Longest Palindromic Subsequence--最长回文子序列长度
- 516. Longest Palindromic Subsequence(最长回文子序列)
- 最长回文子序列 Longest Palindromic Substring
- 【LeetCode】516. Longest Palindromic Subsequence最长回文子序列(非连续)
- [leetCode-516Longest Palindromic Subsequence]最长回文子序列DP算法详解
- leetcode 516. Longest Palindromic Subsequence 最长回文子序列 + DP动态规划
- leetcode 516. Longest Palindromic Subsequence 最大回文子序列
- UVA - 11404 Palindromic Subsequence (最长回文子序列)
- UVa 11404 - Palindromic Subsequence (最长回文子序列 DP)
- Leetcode--Longest Palindromic Substring(最长回文子序列)
- 算法导论15.2 最长回文子序列 Longest palindrome subsequence
- 【LeetCode】5.Longest Palindromic Substring 最长回文子串问题
- 回文子序列 Palindromic Subsequence UVA 11404 动态规划 最长公共子序列
- Longest Palindromic Substring 最长回文子串
- Longest Palindromic Substring-----最长回文子串
- longest palindromic substring(最长回文子串)
- 记录
- linux基本原则
- RNN介绍
- 解决办法: Error:(2, 0) Plugin with id 'com.github.dcendents.android-maven' not found.
- 可逆素数(难度:半颗星)
- 最长子序列回文问题,Longest Palindromic Subsequence
- thinkphp 3.2 使用phpqrcode生成二维码,phpqrcode的使用
- 经典算法1---相似度--模糊查询,查抄袭,语言识别
- lex和yacc环境配置
- 《数学之美》阅读笔记part2——第16章到第31章
- hibernate中实体类对象状态
- C++指针作为函数参数的问题
- 我的学习之路_第二章java入门_接口/多态
- PHP之浅谈RGB