algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add Pascal's Triangle based solution for Unique Paths problem.

Browse Source
This commit is contained in:
Oleksii Trekhleb
2018-07-14 11:08:19 +03:00
parent d8fb6579b1
commit b73ddec94d
4 changed files with 33 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/algorithms/uncategorized/unique-paths/README.md
View File

@@ -94,6 +94,13 @@ the bottom right one with number `3`.
**Auxiliary Space Complexity**: `O(m * n)` - since we need to have DP matrix.
### Pascal's Triangle Based
This question is actually another form of Pascal Triangle.
The corner of this rectangle is at `m + n - 2` line, and
at `min(m, n) - 1` position of the Pascal's Triangle.
## References
- [LeetCode](https://leetcode.com/problems/unique-paths/description/)