Leetcode 1035. Uncrossed Lines

最新推荐文章于 2025-04-20 18:19:38 发布
最新推荐文章于 2025-04-20 18:19:38 发布
阅读量957 收藏 13
点赞数 15
分类专栏： Leetcode 解题报告 动态规划（DP） 文章标签： leetcode 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/mobius_strip/article/details/145671172
版权

Problem

You are given two integer arrays nums1 and nums2. We write the integers of nums1 and nums2 (in the order they are given) on two separate horizontal lines.

We may draw connecting lines: a straight line connecting two numbers nums1[i] and nums2[j] such that:

  • nums1[i] == nums2[j], and
  • the line we draw does not intersect any other connecting (non-horizontal) line.

Note that a connecting line cannot intersect even at the endpoints (i.e., each number can only belong to one connecting line).

Return the maximum number of connecting lines we can draw in this way.

Algorithm

Dynamic Programming (DP): same as Longest Common Subsequence (LCS).

  • If s1[i] != s2[j]:
    F ( i , j ) = max ⁡ ( F ( i − 1 , j ) , F ( i , j − 1 ) ) F(i, j) = \max\left( F(i-1, j), F(i, j-1) \right) F

最低0.47元/天 解锁文章
1035. 不相交的线（其实就是最长公共子序列）
qq_60225495的博客
09-06 212
dp
leetcode动态规划题目总结
日沉云起的博客
04-23 2319
文章目录1. Number Tower，数塔2. Fibonacci Numbers，斐波那契数列3. 0/1 Knapsack, 0/1 背包4. Unbounded Knapsack，无限（完全）背包5. Counting DP，计数 DP5.1. Total Number of Solutions，方案总数5.2. Probability，概率6. Decision Making，决策问题6...
leetcode 1035. Uncrossed Lines
最新发布
weixin_41554427的博客
04-20 210
本题本质上就是求nums1和nums2的最常公共子序列的长度。
LeetCode 1035. Uncrossed Lines
MrJustin的博客
05-26 351
[Med] LeetCode 1035. Uncrossed Lines 链接: https://leetcode.com/problems/uncrossed-lines/ 题目描述： We write the integers of A and B (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines: a straight line connecting t
LeetCode1035. Uncrossed Lines
grllery的博客
05-01 1057
最长公共子序列
leetcode专题训练1035. Uncrossed Lines
Ema1997的博客
05-21 305
这道题算是最长公共子序列的变形。会写公共子序列就可以写这道题。主要的难点是怎么看出这道题是最长公共子序列。设dp[i][j]为到nums1数组的第i个元素、nums2数组的第j个元素（从0开始）的最长公共子序列长度，递推逻辑： dp[i][j] = max(dp[i-1][j], dp[i][j-1]) if nums1[i] == nums2[j]: dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1) 完整代码： class Solution: def maxUn
leetcode 1035. Uncrossed Lines 解法 python
CSerwangjun的博客
04-30 1587
一.问题描述 Example 1: Input: A = [1,4,2], B = [1,2,4] Output: 2 Explanation: We can draw 2 uncrossed lines as in the diagram. We cannot draw 3 uncrossed lines, because the line from A[1]=4 to B[2]=4 ...
【Leetcode】1035. Uncrossed Lines
数学、算法爱好者的博客
11-21 162
想象将两个数组排成两行并且左对齐，求一种两个数组的数字之间的连线方式，使得连线互不相交，并且连接的两个数字都相等。其实就是求最长公共子序列长度，可以动态规划。
LeetCode 1035 Uncrossed Lines（dp 推荐）
Tc的专栏
05-07 261
You are given two integer arraysnums1andnums2. We write the integers ofnums1andnums2(in the order they are given) on two separate horizontal lines. We may draw connecting lines: a straight line connecting two numbersnums1[i]andnums2[j]such that...
leetcode 1035. Uncrossed Lines（不交叉的线）
蓝羽飞鸟的博客
05-11 595
二维DP
[leetcode] 1035. Uncrossed Lines
Learning from the mistakes
09-14 175
Description We write the integers of A and B (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines: a straight line connecting two numbers A[i] and B[j] such that: A[i] == B[j]; The line we draw does not interse
[Leetcode学习]Uncrossed Lines(不相交连线)
qq_28033719的博客
05-26 591
问题： 难度：easy 相关算法： https://blog.csdn.net/qq_28033719/article/details/105727258最长子序列 说明： 给数组 A B，将两个数组进行相同元素连线，每个元素只能连一次，然后算出两个数组之间最多连接多少条线，其实就一个dp。 输入案例 样本1如图 Example 1: Input: A = [1,4,2], B = [1,2,4] Output: 2 Explanation: We can draw 2 unc...
leetcode动态规划习题
10-01
动态规划是一种常用的算法思想，在LeetCode上也有很多与动态规划相关的习题。...7. 不相交的线（Uncrossed Lines）：给定两个数组A和B，分别表示两条数轴上的点的坐标，求在这两条线上没有交叉的最大数对数量。
Leetcode 137. Single Number II
小白菜又菜
01-26 5926
Problem Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space.
Leetcode 134. Gas Station
小白菜又菜
01-25 4684
Problem There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the
Leetcode 135. Candy
小白菜又菜
01-25 3796
Problem There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings. You are giving candies to these children subjected to the following requirements: Each child must have at least one candy. Children w
Leetcode 126. Word Ladder II
小白菜又菜
11-28 3542
Problem A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> … -> sk such that: Every adjacent pair of words differs by a single letter. Every si for 1 <= i
Leetcode 136. Single Number
小白菜又菜
01-25 3140
Problem Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Algorithm Sort the array and then scan for
Leetcode 1143. Longest Common Subsequence
小白菜又菜
07-05 1257
【代码】Leetcode 1143. Longest Common Subsequence。
vscode 安装 leetcode node.js
03-16
即使完成了 Node.js 的安装，仍可能出现类似 “LeetCode extension needs Node.js installed in environment path” 或者 “command ‘leetcode.toggleLeetCodeCn’ not found” 的错误提示[^3]。这通常是因为 ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值