Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitb5f8fe3

Browse files
Merge pull requestyoungyangyang04#482 from LiangDazhu/patch-31
Update 1035.不相交的线.md
2 parents0597ad9 +20fd272 commitb5f8fe3

File tree

1 file changed

+2
-0
lines changed

1 file changed

+2
-0
lines changed

‎problems/1035.不相交的线.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,8 @@
88

99
##1035.不相交的线
1010

11+
题目链接:https://leetcode-cn.com/problems/uncrossed-lines/
12+
1113
我们在两条独立的水平线上按给定的顺序写下 A 和 B 中的整数。
1214

1315
现在,我们可以绘制一些连接两个数字 A[i] 和 B[j] 的直线,只要 A[i] == B[j],且我们绘制的直线不与任何其他连线(非水平线)相交。

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp