求两个字符串的最大子串

求解两个字符串的最大字串

/**
 * Return the max substring for two strings
 *
 * @param str1
 * @param str2
 * 
 */
public static String maxSubString(String str1, String str2) {
    String str = new String();
    // Make the long string str1, the other str2
    if (str1.length() < str2.length()) {
        String temp = str1;
        str1 = str2;
        str2 = temp;
    }
    // if the long string contains short string, return short string
    if (str1.contains(str2))
        return str2;
    
    // From the longest specified length string, match it, from left to right.
    for (int i = str2.length() - 1; i >= 0; i--) {
        for(int j = 0;  (j + i) <str2.length() ; j ++) {
            // if match successfully, return it
            str = str2.substring(j, j+i);
            if(str1.contains(str))
                return str;
        }
    }
    return str;
}
}