公共字串计算

package com.oj5;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Oj {
	
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String data = in.nextLine();
		String[] tran = data.split(" ");
		String strA = tran[0];
		String strB = tran[1];
		String dataA = strA.toLowerCase();
		String dataB = strB.toLowerCase();
		//System.out.println(dataB.substring(1, 7));
		int max = 0;
		for(int i = 1; i<=dataA.length(); i++){		//设置字串的长度
			//System.out.println("长度:"+i);
			for(int j = 0;j < dataA.length(); j++){		//设置起始位置
				int end = j+i>dataA.length()?dataA.length():j+i;
				String temp = dataA.substring(j, end);
				if(dataB.contains(temp)&&(end-j)>max){
					//System.out.println(temp);
					max = end - j;
				}
			}
		}
		
		System.out.println(max);
	}
}