comefrom: <awangdev>Longest Common Substring_3.java
code: public int longestCommonSubstring(String A, String B) {
      	if (A == null || B == null || A.length() == 0 || B.length() == 0) {
      		return 0;
      	}
      	int n = A.length();
      	
      	int max = 0;
      	for (int i = 0; i < n; i++) {
      		for(int j = 0; j <= i; j++) {
      		    String subStr = A.substring(j, i + 1);
          		if (B.contains(subStr)) {
          		    max = Math.max(max, subStr.length());
          		}
      		}
      	}
      	return max;
      }
masked: public int sample_funcname ( String var_0 , String var_1 ) {
    if ( var_0 == null || var_1 == null || var_0 . length ( ) == 0 || var_1 . length ( ) == 0 ) {
      return 0 ;
    }
    int var_2 = var_0 . length ( ) ;
    int max = 0 ;
    for ( int var_3 = 0 ;
    var_3 < var_2 ;
    var_3 ++ ) {
      for ( int var_4 = 0 ;
      var_4 <= var_3 ;
      var_4 ++ ) {
        String var_5 = var_0 . substring ( var_4 , var_3 + 1 ) ;
        if ( var_1 . contains ( var_5 ) ) {
          max = Math . max ( max , var_5 . length ( ) ) ;
        }
      }
    }
    return max ;
  }
  