求两个字符串的最大交集

蛮简单，建个表动态规划几步搞定

public class 字符串最大交集 {
	public static void main(String[] args) {
		String s1="abbbcdef";
		String s2="xvxsadbbbcdef";
		int array[][]=new int[s1.length()][s2.length()];
		for (int i = 0; i < s1.length(); i++) {//init
			for (int j = 0; j < s2.length(); j++) {
				if(s1.charAt(i)==s2.charAt(j)) array[i][j]=1;
				else array[i][j]=0;
			}
		}
		for (int i = 0; i < s1.length(); i++) {
			for (int j = 0; j < s2.length(); j++) {
				if(i-1>=0&&j-1>=0) 
					if(array[i][j]==1)
						array[i][j]+=array[i-1][j-1];
			}
		}
		int a=0;
		for (int i = 0; i < s1.length(); i++) {
			for (int j = 0; j < s2.length(); j++) {
				if(a<array[i][j]) a=array[i][j];
			}
		}
		System.out.println(a);
	}
}