java-求两个字符串最大的共有子串

package sample.Utils;

public  class strUtil {
    public static String MaxSubString(String shortstr, String longstr) {
        String temp = new String("");
        for(int i = 0;i<shortstr.length();i++)/
        {
            for(int j = 0,k = shortstr.length()-i;k<shortstr.length();j++,k++)
            {
                temp = shortstr.substring(j, k);
                if(longstr.contains(temp))
                {
                    return temp;
                }
            }
        }
        return null;
    }
}