1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

#include <iostream>
#include <vector>

class Solution {
public:
    int maxUncrossedLines(std::vector<int>& nums1, std::vector<int>& nums2) {
        int m = nums1.size();
        int n = nums2.size();
        std::vector<int> dp(n + 1);
        
        for (int i = 1; i <= m; ++i) {
            int tmp = 0, tmp2;
            for (int j = 1; j <= n; ++j) {
                tmp2 = dp[j];
                if (nums1[i - 1] == nums2[j - 1]) {
                    dp[j] = tmp + 1;
                }
                else {
                    dp[j] = std::max(dp[j], dp[j - 1]);
                }
                std::swap(tmp, tmp2);
            }
        }
        
        return dp.back();
    }
};