package com.dsw.test;
public class CalculateMaxString {
public static void main(String[] args) {
String src = "abcdefghijklmnopqrstuvwxyz";
String tar = "1234567890abcdfrgtddd12321414";
char [] srcCh = src.toCharArray();
char [] tarCh = tar.toCharArray();
int count = 0;
int max = 0;
StringBuilder sb = null;
String maxString = null;
for(int i=0;i<srcCh.length;i++)
for(int j=0;j<tarCh.length;j++){
sb = new StringBuilder();
int k=j;
int m = i;
count = 0;
while(srcCh[m] == tarCh[k]){
count++;
sb.append(tarCh[k]);
k++;
m++;
}
if(count > max){
max = count;
maxString = sb.toString();
}
}
System.out.println("原字符串:" + src);
System.out.println("子字符串:" + tar);
System.out.println(maxString);
}
}
最大公共子序列
最新推荐文章于 2021-03-10 12:07:42 发布