求两个字符串的最大公共子串

public class Temp {

    public static String longestCommonString(String a, String b) {
        if (a == null || b == null || a.length() == 0 || b.length() == 0) {
            return "";
        }

        int aLen = a.length();
        int bLen = b.length();
        int[][] matrix = new int[aLen][bLen];

        int iMax = 0;
        int maxLen = 0;
        for (int i = 0; i < aLen; i++) {
            for (int j = 0; j < bLen; j++) {
                if (a.charAt(i) == b.charAt(j)) {
                    matrix[i][j] = (i > 0 && j > 0) ? matrix[i - 1][j - 1] + 1 : 1;
                    if (matrix[i][j] > maxLen) {
                        maxLen = matrix[i][j];
                        iMax = i;
                    }
                }
            }
        }

        String commonStr = "";
        if (maxLen > 0) {
            commonStr = a.substring(iMax - maxLen + 1, iMax + 1);
        }

        return commonStr;
    }

    public static void main(String[] args) {
        System.out.println(longestCommonString("abcde", "uibcdmn"));
    }
}