From 23d57f678335a55a1ad488db3448764c88ccf1a6 Mon Sep 17 00:00:00 2001 From: zhaocchen Date: Tue, 20 Jul 2021 23:01:41 +0800 Subject: [PATCH] feat: add typescript solution to lc problem: No.0062.Unique Paths --- solution/0000-0099/0062.Unique Paths/README.md | 14 ++++++++++++++ solution/0000-0099/0062.Unique Paths/README_EN.md | 14 ++++++++++++++ solution/0000-0099/0062.Unique Paths/Solution.ts | 9 +++++++++ 3 files changed, 37 insertions(+) create mode 100644 solution/0000-0099/0062.Unique Paths/Solution.ts diff --git a/solution/0000-0099/0062.Unique Paths/README.md b/solution/0000-0099/0062.Unique Paths/README.md index 7aa67acd6602f..5efc9f98ce5a9 100644 --- a/solution/0000-0099/0062.Unique Paths/README.md +++ b/solution/0000-0099/0062.Unique Paths/README.md @@ -99,6 +99,20 @@ class Solution { } ``` +### **TypeScript** + +```ts +function uniquePaths(m: number, n: number): number { + let dp = Array.from({length: m}, v => new Array(n).fill(1)); + for (let i = 1; i < m; ++i) { + for (let j = 1; j < n; ++j) { + dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; + } + } + return dp[m-1][n-1]; +}; +``` + ### **C++** ```cpp diff --git a/solution/0000-0099/0062.Unique Paths/README_EN.md b/solution/0000-0099/0062.Unique Paths/README_EN.md index 9399a47ed14dc..48635580b3c20 100644 --- a/solution/0000-0099/0062.Unique Paths/README_EN.md +++ b/solution/0000-0099/0062.Unique Paths/README_EN.md @@ -89,6 +89,20 @@ class Solution { } ``` +### **TypeScript** + +```ts +function uniquePaths(m: number, n: number): number { + let dp = Array.from({length: m}, v => new Array(n).fill(1)); + for (let i = 1; i < m; ++i) { + for (let j = 1; j < n; ++j) { + dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; + } + } + return dp[m-1][n-1]; +}; +``` + ### **C++** ```cpp diff --git a/solution/0000-0099/0062.Unique Paths/Solution.ts b/solution/0000-0099/0062.Unique Paths/Solution.ts new file mode 100644 index 0000000000000..ec32f42ffe2db --- /dev/null +++ b/solution/0000-0099/0062.Unique Paths/Solution.ts @@ -0,0 +1,9 @@ +function uniquePaths(m: number, n: number): number { + let dp = Array.from({length: m}, v => new Array(n).fill(1)); + for (let i = 1; i < m; ++i) { + for (let j = 1; j < n; ++j) { + dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; + } + } + return dp[m-1][n-1]; +}; \ No newline at end of file