Day45 动态规划 — 子序列

300. 最长递增子序列

class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        if (nums.size() <= 1) return 1;
        
        vector<int> dp(nums.size(), 1);

        int ret = INT_MIN;
        for (int i = 1; i < nums.size(); i++) {
            for (int j = 0; j < i; j++) {
                if (nums[i] > nums[j]) {
                    dp[i] = std::max(dp[i], dp[j] + 1);
                }
            }
            if (dp[i] > ret) ret = dp[i];
        }

        return ret;
    }
};

674. 最长连续递增序列

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if (nums.size() <= 1) return 1;

        vector<int> dp(nums.size(), 1);

        int ret = 1;
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] > nums[i-1]) {
                dp[i] = dp[i-1] + 1;
                if (dp[i] > ret) ret = dp[i];
            } else {
                dp[i] = 1;
            }
        }

        return ret;
    }
};

718. 最长重复子数组

    class Solution {
    public:
        int findLength(vector<int>& nums1, vector<int>& nums2) {
            vector<vector<int>> dp(nums1.size(), vector<int>(nums2.size(), 0));
            int ret = 0;

            for (int i = 0; i < nums1.size(); i++) if(nums1[i] == nums2[0]) {dp[i][0] = 1; ret = 1;}
            for (int j = 0; j < nums2.size(); j++) if(nums1[0] == nums2[j]) {dp[0][j] = 1; ret = 1;}

            
            for (int i = 1; i < nums1.size(); i++) {
                for (int j = 1; j < nums2.size(); j++) {
                    if (nums1[i] == nums2[j]) dp[i][j] = dp[i-1][j-1] + 1;
                    if (dp[i][j] > ret) ret = dp[i][j];
                }
            }

            // for (const auto& row : dp) {
            //     for (const auto& element : row) {
            //         std::cout << element << " ";
            //     }
            //     std::cout << std::endl;
            // }

            return ret;
        }
    };