Skip to content
Merged
Changes from 1 commit
Commits
Show all changes
19 commits
Select commit Hold shift + click to select a range
568a569
添加(1143.最长公共子序列.md):增加typescript版本
xiaofei-2020 May 19, 2022
b3335f7
添加 763.划分字母区间 补充思路的Java代码实现
May 19, 2022
30c1be1
添加(1035.不相交的线.md):增加typescript版本
xiaofei-2020 May 19, 2022
4d2b80c
添加(0053.最大子序和动态规划.md):增加typescript版本
xiaofei-2020 May 19, 2022
8759349
添加(0392.判断子序列.md):增加typescript版本
xiaofei-2020 May 19, 2022
4eefc54
添加(0115.不同的子序列.md):增加typescript版本
xiaofei-2020 May 20, 2022
58c4ad4
添加(0583.两个字符串的删除操作.md):增加typescript版本
xiaofei-2020 May 20, 2022
fa3a45c
添加(0072.编辑距离.md):增加typescript版本
xiaofei-2020 May 20, 2022
be7d6e1
添加 0226.翻转二叉树.md Scala版本
wzqwtt May 20, 2022
81d4685
添加 0101.对称二叉树.md Scala版本
wzqwtt May 20, 2022
7163601
Merge pull request #1358 from xiaofei-2020/dp44
youngyangyang04 Jun 12, 2022
a054544
Merge pull request #1359 from zhouchaoyu1/master
youngyangyang04 Jun 13, 2022
6b8692c
Merge pull request #1361 from xiaofei-2020/dp45
youngyangyang04 Jun 13, 2022
3071e3b
Merge pull request #1362 from xiaofei-2020/dp46
youngyangyang04 Jun 13, 2022
7886da3
Merge pull request #1364 from xiaofei-2020/dp47
youngyangyang04 Jun 13, 2022
9727003
Merge pull request #1366 from xiaofei-2020/dp48
youngyangyang04 Jun 13, 2022
6d130e7
Merge pull request #1367 from xiaofei-2020/dp49
youngyangyang04 Jun 13, 2022
f9aeae5
Merge pull request #1368 from xiaofei-2020/dp50
youngyangyang04 Jun 13, 2022
e9cdb3e
Merge pull request #1369 from wzqwtt/tree06
youngyangyang04 Jun 13, 2022
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
添加(1035.不相交的线.md):增加typescript版本
  • Loading branch information
xiaofei-2020 committed May 19, 2022
commit 30c1be11ff9ef77ff6cf0294f37b09ae50ea4619
24 changes: 24 additions & 0 deletions problems/1035.不相交的线.md
Original file line number Diff line number Diff line change
Expand Up @@ -183,6 +183,30 @@ const maxUncrossedLines = (nums1, nums2) => {
};
```

TypeScript:

```typescript
function maxUncrossedLines(nums1: number[], nums2: number[]): number {
/**
dp[i][j]: nums1前i-1个,nums2前j-1个,最大连线数
*/
const length1: number = nums1.length,
length2: number = nums2.length;
const dp: number[][] = new Array(length1 + 1).fill(0)
.map(_ => new Array(length2 + 1).fill(0));
for (let i = 1; i <= length1; i++) {
for (let j = 1; j <= length2; j++) {
if (nums1[i - 1] === nums2[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
return dp[length1][length2];
};
```




Expand Down