Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-15-lattice-paths.md
Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g
2020-10-06 23:10:08 +05:30

1.2 KiB
Raw Blame History

id, challengeType, videoUrl, title
id challengeType videoUrl title
5900f37b1000cf542c50fe8e 5 问题15格子路径

Description

从2×2网格的左上角开始只能向右和向下移动右下角有6条路线。 6 2乘2网格的图表显示了右下角的所有路线

通过给定的gridSize有多少这样的路由?

Instructions

Tests

tests:
  - text: <code>latticePaths(4)</code>应该返回70。
    testString: assert.strictEqual(latticePaths(4), 70);
  - text: <code>latticePaths(9)</code>应该返回48620。
    testString: assert.strictEqual(latticePaths(9), 48620);
  - text: <code>latticePaths(20)</code>应该返回137846528820。
    testString: assert.strictEqual(latticePaths(20), 137846528820);

Challenge Seed

function latticePaths(gridSize) {
  // Good luck!
  return true;
}

latticePaths(4);

Solution

// solution required

/section>