comefrom: <awangdev>Longest Common Subsequence_4.java
code: public int longestCommonSubsequence(String A, String B) {
          if (A == null || B == null || A.length() == 0 || B.length() == 0) {
              return 0;
          }
          int[][] check = new int[A.length()  + 1][B.length() + 1];
          for (int i = 1; i <= A.length(); i++) {
              for (int j = 1; j <= B.length(); j++) {
                  if (A.charAt(i - 1) == B.charAt(j - 1)) {
                      check[i][j] = check[i - 1][j - 1] + 1;
                  } else {
                      check[i][j] = Math.max(check[i][j], check[i - 1][j]);
                      check[i][j] = Math.max(check[i][j], check[i][j - 1]);
                  }
              }
          }
          return check[A.length()][B.length()];
      }
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 = new int [ var_0 . length ( ) + 1 ] [ var_1 . length ( ) + 1 ] ;
    for ( int var_3 = 1 ;
    var_3 <= var_0 . length ( ) ;
    var_3 ++ ) {
      for ( int var_4 = 1 ;
      var_4 <= var_1 . length ( ) ;
      var_4 ++ ) {
        if ( var_0 . charAt ( var_3 - 1 ) == var_1 . charAt ( var_4 - 1 ) ) {
          var_2 [ var_3 ] [ var_4 ] = var_2 [ var_3 - 1 ] [ var_4 - 1 ] + 1 ;
        }
        else {
          var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 ] [ var_4 ] , var_2 [ var_3 - 1 ] [ var_4 ] ) ;
          var_2 [ var_3 ] [ var_4 ] = Math . max ( var_2 [ var_3 ] [ var_4 ] , var_2 [ var_3 ] [ var_4 - 1 ] ) ;
        }
      }
    }
    return var_2 [ var_0 . length ( ) ] [ var_1 . length ( ) ] ;
  }
  