comefrom: <qiyuangong>062_Unique_Paths_1.py
code: def uniquePaths( m, n):
      dmap = [[0] * n for _ in range(m)]
      for i in range(m):
          dmap[i][0] = 1
      for j in range(n):
          dmap[0][j] = 1
      for i in range(1, m):
          for j in range(1, n):
              l = u = 0
              if i-1 >= 0:
                  u = dmap[i-1][j]
              if j-1>= 0:
                  l = dmap[i][j-1]
              dmap[i][j] = l + u
      return dmap[m-1][n-1]
masked: def sample_funcname ( var_0 , var_1 ) :
      var_5 = [ [ 0 ] * var_1 for var_3 in range ( var_0 ) ]
      for var_6 in range ( var_0 ) :
          var_5 [ var_6 ] [ 0 ] = 1
      for var_8 in range ( var_1 ) :
          var_5 [ 0 ] [ var_8 ] = 1
      for var_6 in range ( 1 , var_0 ) :
          for var_8 in range ( 1 , var_1 ) :
              var_10 = var_9 = 0
              if var_6 - 1 >= 0 :
                  var_9 = var_5 [ var_6 - 1 ] [ var_8 ]
              if var_8 - 1 >= 0 :
                  var_10 = var_5 [ var_6 ] [ var_8 - 1 ]
              var_5 [ var_6 ] [ var_8 ] = var_10 + var_9
      return var_5 [ var_0 - 1 ] [ var_1 - 1 ]
  