comefrom: <awangdev>62. Unique Path_2.java
code: public int uniquePaths(int m, int n) {
          if (m == 0 || n == 0) return 0;
          int[][] dp = new int[2][n];
          for (int i = 0; i < 2; i++) dp[i][0] = 1;
          for (int i = 0; i < n; i++) dp[0][i] = 1;
  
          for (int i = 1; i < m; i++) {
              for (int j = 1; j < n; j++) {
                  dp[i%2][j] = dp[(i - 1)%2][j] + dp[i%2][j - 1];
              }
          }
          return dp[(m-1)%2][n-1];        
      }
masked: public int sample_funcname ( int var_0 , int var_1 ) {
    if ( var_0 == 0 || var_1 == 0 ) return 0 ;
    int [ ] [ ] var_4 = new int [ 2 ] [ var_1 ] ;
    for ( int var_5 = 0 ;
    var_5 < 2 ;
    var_5 ++ ) var_4 [ var_5 ] [ 0 ] = 1 ;
    for ( int var_5 = 0 ;
    var_5 < var_1 ;
    var_5 ++ ) var_4 [ 0 ] [ var_5 ] = 1 ;
    for ( int var_5 = 1 ;
    var_5 < var_0 ;
    var_5 ++ ) {
      for ( int var_7 = 1 ;
      var_7 < var_1 ;
      var_7 ++ ) {
        var_4 [ var_5 % 2 ] [ var_7 ] = var_4 [ ( var_5 - 1 ) % 2 ] [ var_7 ] + var_4 [ var_5 % 2 ] [ var_7 - 1 ] ;
      }
    }
    return var_4 [ ( var_0 - 1 ) % 2 ] [ var_1 - 1 ] ;
  }
  