Java_动态规划|回溯|最长公共子序列(Longest Common Sequence)|LCS
/***核心算法:*当i=0||j=0时,c[i,j]=0*当xi=yj时,c[i,j]=c[i-1,j-1]+1*当xi!=yj时,c[i,j]=max{c[i-1,j],c[i,j-1]}**@authorChillLyn**/classLongestCommonSequence{publicstaticvoidmain(String[]args){//定义两个字符串Stringx="0358