对于求最长递增子序列和最长公共子序列的问题,最简单的方法就是动态规划
最长递增子序列
给定义一组数据【-1,2,4,3,5,6,7,5】,最长递增子序列是-1,2,3,5,6,7,结果为6
思路:dp[i]来记录a[i]为结尾的子序列中最大递增子序列的长度,对于每一个i,令j从1到i - 1遍历,当a[j] < a[i],比较当前d[i]和每一个d[j] + 1的大小,将最大值赋给d[i]。..
public class Test3 {
public static void main(String[] args) {
int[] a={-1,2,4,3,5,6,7,5};
System.out.print(increList(a));//最长递增子序列长度
}
private static int increList(int[] a) {
int length=a.length;
if(length==0){
return 0;
}
int maxCount=0;
int[] dp=new int[length];
for (int i = 0; i < length; i++) {
dp[i]=1;
for (int j = 0; j < i; j++) {
if(a[j]<a[i])
dp[i]=dp[i]>dp[j]+1?dp[i]:dp[j]+1;
if(maxCount<dp[i])
maxCount=dp[i];
}
}
return maxCount;
}
}
最长公共子序列
给定2个序列,求这两个序列的最长公共子序列,不要求子序列连续(序列中的数有先后顺序)。例如{2,4,3,1,2,1}和{1,2,3,2,4,1,2}的结果是{2,3,2,1},{2,3,1,2}和{2,4,1,2},也就是最长公共子序列长度唯一,但子序列不唯一。
public class Solution {
//最长公共子序列
public static void findLCS(String a ,String b) {
int s1len = a.length();
int s2len = b.length();
char[] s1 = a.toCharArray();
char[] s2 = b.toCharArray();
int[][] lcs = new int[s1len][s2len];
//把第一行写好
int flag = 0;
for (int i = 0; i < s2len ; i++) {
if (s1[0] == s2[i]) {
flag = 1;
}
lcs[0][i] = flag;
}
//把第一列写好
flag = 0;
for (int i = 0; i < s1len; i++) {
if (s2[0] == s1[i]) {
flag = 1;
}
lcs[i][0] = flag;
}
for (int i = 1; i < s1len; i++) {
for (int j = 1; j < s2len; j++) {
if (s1[i] == s2[j]) {
//如果对比时,某两个字符相等,那么当前最大值 = 两个s都不看这个当前字符时候的最大值+1
lcs[i][j] = lcs[i - 1][j - 1] + 1;
}
else {
//他等于两个字符串分别上一次匹配的最大值
lcs[i][j] = Math.max(lcs[i - 1][j], lcs[i][j - 1]);
}
}
}
// displayArr(lcs ,s1len , s2len);
System.out.println(lcs[s1len - 1][s2len - 1]);
}
//最长连续公共子序列
public static void findContinueLCS(String a,String b) {
int len1 = a.length();
int len2 = b.length();
int dp[][] = new int[len1+1][len2+1];
for (int i = 0; i < dp.length; i++) {
dp[i][0] = 0;
}
for (int i = 0; i < dp[0].length; i++) {
dp[0][i] = 0;
}
int max = 0;
for (int i = 1; i < dp.length; i++) {
for (int j = 1; j < dp[0].length; j++) {
if (a.charAt(i-1) == b.charAt(j-1)) {
if (i == 0|| j == 0) {
dp[i][j] = 1;
}
else {
dp[i][j] = dp[i-1][j-1] + 1;
}
}
else {
dp[i][j] = 0;
}
if (max < dp[i][j]) {
max = dp[i][j];
}
}
}
System.out.println(max);
}
//打印数组
public static void displayArr(int[][] arr, int row, int col) {
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String a = sc.next();
String b = sc.next();
findLCS(a, b);
findContinueLCS(a, b);
}
}
参考:https://blog.csdn.net/likunkun__/article/details/80450268