Given two strings, find the longest common substring.
Return the length of it.
分析:算法与最长公共子序列大致相似。二维DP。区别是,字符不同时,res[i][j] = 0;并另一个额外的int记录最大长度。
public class Solution {
/**
* @param A, B: Two string.
* @return: the length of the longest common substring.
*/
public int longestCommonSubstring(String A, String B) {
if(A.length() == 0 || B.length() == 0) return 0;
int[][] res = new int[A.length()][B.length()];
res[0][0] = A.charAt(0) == B.charAt(0) ? 1 : 0;
int max = res[0][0];
for(int i = 1; i < A.length(); i++) {
res[i][0] = A.charAt(i) == B.charAt(0) ? 1 : 0;
max = Math.max(max, res[i][0]);
}
for(int j = 1; j < B.length(); j++) {
res[0][j] = B.charAt(j) == A.charAt(0) ? 1 : 0;
max = Math.max(max, res[0][j]);
}
for(int i = 1; i < A.length(); i++) {
for(int j = 1; j < B.length(); j++) {
if(A.charAt(i) == B.charAt(j)) {
res[i][j] = res[i - 1][j - 1] + 1;
max = Math.max(max, res[i][j]);
} else {
res[i][j] = 0;
}
}
}
return max;
}
}