79 - 最长公共子串

2017.9.26

依次选取A中的子串，检查B中是不是包含就可以了

public class Solution {
    /*
     * @param A: A string
     * @param B: A string
     * @return: the length of the longest common substring.
     */
    	public static int longestCommonSubstring(String A, String B) {
        // write your code here
		int res = 0;
		int s1 = A.length();
		int s2 = B.length();
		// s1始终为较短的那个字符串
		if(s1 > s2){
			String tmp = A;
			A = B;
			B = tmp;
			int tmp1 = s1;
			s1 = s2;
			s2 = tmp1;
		}
		// i表示子串的长度
		for(int i = s1; i >= 1 ;i--){
			for(int j = 0; j+i <= s1; j++){
				String tmp = A.substring(j, j+i);
				if(B.contains(tmp)){
					return i;
				}
			}
		}
		return res;
	}
}