leetcode1035题:不相交的线

思路：最长公共子序列、动态规划

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int unintersect_line(vector<int>& nums1,vector<int>& nums2)
{
	int len1=nums1.size();
	int len2=nums2.size();
	vector<vector<int>> dp(len1+1,vector<int>(len2+1,0));
	for(int i=0;i<len1;i++)
	{
		for(int j=0;j<len2;j++)
		{
			if(nums1[i]==nums2[j])
			{
				dp[i+1][j+1]=dp[i][j]+1;
			}
			else dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1]);
		}
	}
	return dp[len1][len2];
}

int main()
{
	vector<int> nums1{1,2,4};
	vector<int> nums2{1,4,2};
	cout<<unintersect_line(nums1,nums2)<<endl;
	return 0;
}