comefrom: <gouthampradhan>dynamic_programming_OnesAndZeroes_1.java
code: public int findMaxForm(String[] strs, int m, int n) {
      int[][][] dp = new int[strs.length + 1][m + 1][n + 1];
      for (int i = strs.length - 1; i >= 0; i--) {
        String string = strs[i];
        int zero = 0;
        int one = 0;
        for (char c : string.toCharArray()) {
          if (c == '0') {
            zero++;
          } else {
            one++;
          }
        }
        for (int p = m; p >= 0; p--) {
          for (int q = n; q >= 0; q--) {
            dp[i][p][q] = dp[i + 1][p][q];
            if (p - zero >= 0 && q - one >= 0) {
              dp[i][p][q] = Math.max(dp[i][p][q], dp[i + 1][p - zero][q - one] + 1);
            }
          }
        }
      }
      return dp[0][m][n];
    }
masked: public int sample_funcname ( String [ ] var_1 , int var_2 , int var_3 ) {
    int [ ] [ ] [ ] var_6 = new int [ var_1 . length + 1 ] [ var_2 + 1 ] [ var_3 + 1 ] ;
    for ( int var_7 = var_1 . length - 1 ;
    var_7 >= 0 ;
    var_7 -- ) {
      String var_9 = var_1 [ var_7 ] ;
      int var_10 = 0 ;
      int var_11 = 0 ;
      for ( char var_13 : var_9 . toCharArray ( ) ) {
        if ( var_13 == '0' ) {
          var_10 ++ ;
        }
        else {
          var_11 ++ ;
        }
      }
      for ( int var_15 = var_2 ;
      var_15 >= 0 ;
      var_15 -- ) {
        for ( int var_16 = var_3 ;
        var_16 >= 0 ;
        var_16 -- ) {
          var_6 [ var_7 ] [ var_15 ] [ var_16 ] = var_6 [ var_7 + 1 ] [ var_15 ] [ var_16 ] ;
          if ( var_15 - var_10 >= 0 && var_16 - var_11 >= 0 ) {
            var_6 [ var_7 ] [ var_15 ] [ var_16 ] = Math . max ( var_6 [ var_7 ] [ var_15 ] [ var_16 ] , var_6 [ var_7 + 1 ] [ var_15 - var_10 ] [ var_16 - var_11 ] + 1 ) ;
          }
        }
      }
    }
    return var_6 [ 0 ] [ var_2 ] [ var_3 ] ;
  }
  