算法实践-求最长公共子序列-动态规划

发布一个k8s部署视频：https://edu.csdn.net/course/detail/26967

课程内容：各种k8s部署方式。包括minikube部署，kubeadm部署，kubeasz部署，rancher部署，k3s部署。包括开发测试环境部署k8s，和生产环境部署k8s。

腾讯课堂连接地址https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518

第二个视频发布  https://edu.csdn.net/course/detail/27109

腾讯课堂连接地址https://ke.qq.com/course/484107?tuin=ba64518

介绍主要的k8s资源的使用配置和命令。包括configmap，pod，service，replicaset，namespace，deployment，daemonset，ingress，pv，pvc，sc，role，rolebinding，clusterrole，clusterrolebinding，secret，serviceaccount，statefulset，job，cronjob，podDisruptionbudget，podSecurityPolicy,networkPolicy,resourceQuota，limitrange，endpoint，event，conponentstatus，node，apiservice，controllerRevision等。

第三个视频发布：https://edu.csdn.net/course/detail/27574

详细介绍helm命令，学习helm chart语法，编写helm chart。深入分析各项目源码，学习编写helm插件
————————————————------------------------------------------------------------------------------------------------------------------

 

package com.dynamic;

public class LongestCommonSubSequence {
	private char[] seqA;
	private char[] seqB;
	private int [][] memory;
	private int[][]b;
	public LongestCommonSubSequence(char[]seqA,char []seqB){
		this.seqA=seqA;
		this.seqB=seqB;
		memory=new int[seqA.length][seqB.length];
		for(int i=0;i<seqA.length;i++){
			for(int j=0;j<seqB.length;j++){
				memory[i][j]=-1;
			}
		}
		b=new int[seqA.length][seqB.length];
	}
	
	public int lcsLength(){
		return innerLcsLength(seqA.length,seqB.length);
	}
	public int innerLcsLength(int i,int j){
		if(i==0||j==0){
			return 0;
		}
		if(memory[i-1][j-1]>=0){
			return memory[i-1][j-1];
		}
		int tmp;
		if(i>0&&j>0&&seqA[i-1]==seqB[j-1]){
			tmp= innerLcsLength(i-1,j-1)+1;
			b[i-1][j-1]=1;
		}else if(innerLcsLength(i-1,j)>innerLcsLength(i,j-1)){
			tmp= innerLcsLength(i-1,j);
			b[i-1][j-1]=2;
		}else{
			tmp=innerLcsLength(i,j-1);
			b[i-1][j-1]=3;
		}
		memory[i-1][j-1]=tmp;
		return tmp;
		
	}
	
	public void printLcs(){
		innerPrintLcs(seqA.length,seqB.length);
	}
	private void innerPrintLcs(int i,int j){
		if(i==0||j==0){
			return;
		}
		if(b[i-1][j-1]==1){
			innerPrintLcs(i-1,j-1);
			System.out.print(seqA[i-1]+" ");
		}else if(b[i-1][j-1]==2){
			innerPrintLcs(i-1,j);
		}else{
			innerPrintLcs(i,j-1);
		}
	}

	public static void main(String[] args) {
		char[]seqA=new char[]{'A','B','C','B','D','A','B'};
		char [] seqB=new char[]{'B','D','C','A','B','A'};
		LongestCommonSubSequence lcs=new LongestCommonSubSequence(seqA,seqB);
		System.out.println(lcs.lcsLength());
		lcs.printLcs();

	}

}