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_0 ) {
    char [ ] var_1 = var_0 . toCharArray ( ) ;
    int var_2 = var_0 . length ( ) ;
    int [ ] [ ] var_3 = new int [ var_2 ] [ var_2 ] ;
    for ( int var_4 = var_2 - 1 ;
    var_4 >= 0 ;
    var_4 -- ) {
      var_3 [ var_4 ] [ var_4 ] = 1 ;
      for ( int var_5 = var_4 + 1 ;
      var_5 < var_2 ;
      var_5 ++ ) {
        if ( var_1 [ var_4 ] == var_1 [ var_5 ] ) var_3 [ var_4 ] [ var_5 ] = var_3 [ var_4 + 1 ] [ var_5 - 1 ] + 2 ;
        else var_3 [ var_4 ] [ var_5 ] = Math . max ( var_3 [ var_4 + 1 ] [ var_5 ] , var_3 [ var_4 ] [ var_5 - 1 ] ) ;
      }
    }
    return var_3 [ 0 ] [ var_2 - 1 ] ;
  }
  