comefrom: <awangdev>516. Longest Palindromic Subsequence_1.java
code: public int longestPalindromeSubseq(String s) {
          char[] ss = s.toCharArray();
          int n = s.length();
          int[][] dp = new int[n][n];
          
          for (int i = n - 1; i >= 0; i--) { 
              dp[i][i] = 1;
              for (int j = i + 1; j < n; j++) {
                  if (ss[i] == ss[j]) dp[i][j] = dp[i + 1][j - 1] + 2;
                  else dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]); 
              }
          }
          return dp[0][n - 1];
      }
masked: public int sample_funcname ( String var_1 ) {
    char [ ] var_3 = var_1 . toCharArray ( ) ;
    int var_5 = var_1 . length ( ) ;
    int [ ] [ ] var_6 = new int [ var_5 ] [ var_5 ] ;
    for ( int var_8 = var_5 - 1 ;
    var_8 >= 0 ;
    var_8 -- ) {
      var_6 [ var_8 ] [ var_8 ] = 1 ;
      for ( int var_10 = var_8 + 1 ;
      var_10 < var_5 ;
      var_10 ++ ) {
        if ( var_3 [ var_8 ] == var_3 [ var_10 ] ) var_6 [ var_8 ] [ var_10 ] = var_6 [ var_8 + 1 ] [ var_10 - 1 ] + 2 ;
        else var_6 [ var_8 ] [ var_10 ] = Math . max ( var_6 [ var_8 + 1 ] [ var_10 ] , var_6 [ var_8 ] [ var_10 - 1 ] ) ;
      }
    }
    return var_6 [ 0 ] [ var_5 - 1 ] ;
  }
  