/*

    • @lc app=leetcode.cn id=62 lang=javascript
    • [62] 不同路径
      */

    // @lc code=start
    /**

    • @param {number} m

    • @param {number} n

    • @return {number}
      */
      var uniquePaths = function(m, n) {
      let arr = new Array(m).fill(0);
      arr = arr.map((item,index)=>{
      let val = index===0?1:0;
      let arr = new Array(n).fill(val)
      arr[0] = 1;
      return arr
      })
      for (let i = 1; i < m; i++) {
      for (let j = 1; j < n; j++) {
      arr[i][j] = arr[i-1][j] + arr[i][j-1];
      }
      }
      return arr[m-1][n-1]

    };
    // uniquePaths(3,7)
    console.log(‘uniquePaths(3,7): ‘, uniquePaths(3,2));
    // @lc code=end