php 两数最大相同子串,给定两个字符串，获取两个字符串中最大相同的子串.

这题，有个算法就是利用动态规划进行解答，有点难度。最差的算法就是通过遍历统计出每次的字符串，找到最大的字符串，然后输出。

package com.dsw.test;

public class CalculateMaxString {

public static void main(String[] args) {

String src = "abstractfistreamleoutput";

String tar = "maeetstuptuoestreamliftcartsba";

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

for(int j=0;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(m == srcCh.length || k == tarCh.length)break;

}

if(count > max){//统计最大的字符串

max = count;

maxString = sb.toString();

}

}

System.out.println("原字符串:" + src);

System.out.println("子字符串:" + tar);

System.out.println(maxString);

}

}

代码我写的就这样，效率差，凑合看吧！

原字符串:abstractfistreamleoutput

子字符串:maeetstuptuoestreamliftcartsba

streaml