comefrom: <awangdev>Minimum Swaps To Make Sequences Increasing_1.java
code: public int minSwap(int[] A, int[] B) {
          if (A.length != B.length) return 0;
          
          int n = A.length;
          int[][] dp = new int[n][2];
          dp[0][0] = 0;
          dp[0][1] = 1;
          
          for (int i = 1; i < n; i++) {
              dp[i][0] = dp[i][1] = Integer.MAX_VALUE;
              if (A[i] > A[i - 1] && B[i] > B[i - 1]) { 
                  dp[i][0] = dp[i - 1][0];              
                  dp[i][1] = dp[i - 1][1] + 1; 
              }
              if (A[i] > B[i - 1] && B[i] > A[i - 1]) {
                  dp[i][0] = Math.min(dp[i][0], dp[i - 1][1]);     
                  dp[i][1] = Math.min(dp[i][1], dp[i - 1][0] + 1); 
              }
          }
          return Math.min(dp[n-1][0], dp[n-1][1]);
      }
masked: public int sample_funcname ( int [ ] var_0 , int [ ] var_1 ) {
    if ( var_0 . length != var_1 . length ) return 0 ;
    int var_4 = var_0 . length ;
    int [ ] [ ] var_6 = new int [ var_4 ] [ 2 ] ;
    var_6 [ 0 ] [ 0 ] = 0 ;
    var_6 [ 0 ] [ 1 ] = 1 ;
    for ( int var_8 = 1 ;
    var_8 < var_4 ;
    var_8 ++ ) {
      var_6 [ var_8 ] [ 0 ] = var_6 [ var_8 ] [ 1 ] = Integer . MAX_VALUE ;
      if ( var_0 [ var_8 ] > var_0 [ var_8 - 1 ] && var_1 [ var_8 ] > var_1 [ var_8 - 1 ] ) {
        var_6 [ var_8 ] [ 0 ] = var_6 [ var_8 - 1 ] [ 0 ] ;
        var_6 [ var_8 ] [ 1 ] = var_6 [ var_8 - 1 ] [ 1 ] + 1 ;
      }
      if ( var_0 [ var_8 ] > var_1 [ var_8 - 1 ] && var_1 [ var_8 ] > var_0 [ var_8 - 1 ] ) {
        var_6 [ var_8 ] [ 0 ] = Math . min ( var_6 [ var_8 ] [ 0 ] , var_6 [ var_8 - 1 ] [ 1 ] ) ;
        var_6 [ var_8 ] [ 1 ] = Math . min ( var_6 [ var_8 ] [ 1 ] , var_6 [ var_8 - 1 ] [ 0 ] + 1 ) ;
      }
    }
    return Math . min ( var_6 [ var_4 - 1 ] [ 0 ] , var_6 [ var_4 - 1 ] [ 1 ] ) ;
  }
  