不相交的线-CSDN博客

本文链接：https://blog.csdn.net/ElseWhereR/article/details/144876055

*************

C++

*************

The topice is here:

The first topic in 2025, have some inspiration. Need passion in the very fresh new year.

the numbers in vector 2 match the numbers in vector 1. This way is something like LCS， which is the longest commom subsquence.最长公共子序列-CSDN博客https://blog.csdn.net/ElseWhereR/article/details/143971009?spm=1001.2014.3001.5501

So the topic is just like that.

BTY， today when I glance over the moments, I found them have a really happy new year's eve.

The fireworks, the yummy cakes, someone falls when skiing and slogan is 'hey baby, sleeping is forbidden here', the first rays of the new year, free balloons, go to the wharf and have some chips.

lovely friends.

copy the code and do little changes;

class Solution {
public:
    int maxUncrossedLines(vector<int>& nums1, vector<int>& nums2) {
        
         // write the follows without hesitation
        int m = nums1.size();
        int n = nums2.size();
        vector<vector<int>> dp(m + 1, vector(n + 1, 0));
 
        // main code 
        for (int i = 1; i <= m; i++){
            for (int j = 1; j <= n; j++){
//change the text to nums
                 if (nums1 [i - 1] == nums2 [j - 1]){ // special attention to the number
                    dp[i][j] = dp[i-1][j-1] + 1;
                } else {
                     dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); // more ez formula
                    }
            }
        }
 
        return dp[m][n];

    }
};

the main idea is here:

define dp[i][j] is the longest commom sunsquence. equation of transfer is as follow