Update 62.unique-paths.md

problems/62.unique-paths.md

@@ -64,26 +64,6 @@ Output: 28
 
 代码大概是：
 
-JS Code:
-
-```js
-const dp = [];
-for (let i = 0; i < m + 1; i++) {
-  dp[i] = [];
-  dp[i][0] = 0;
-}
-for (let i = 0; i < n + 1; i++) {
-  dp[0][i] = 0;
-}
-for (let i = 1; i < m + 1; i++) {
-  for (let j = 1; j < n + 1; j++) {
-    dp[i][j] = j === 1 ? 1 : dp[i - 1][j] + dp[i][j - 1]; // 转移方程
-  }
-}
-
-return dp[m][n];
-```
-
 Python Code:
 
 ```python