Longest Common Subsequence II-LintCode

Given two sequence P and Q of numbers. The task is to find Longest Common Subsequence of two sequence if we are allowed to change at most k element in first sequence to any value.

样例
Given P = [8 ,3], Q = [1, 3], K = 1
Return 2

Given P = [1, 2, 3, 4, 5], Q = [5, 3, 1, 4, 2], K = 1
Return 3

思路
dp[i][j][t]表示P的前i个数字和Q的前j个数字中,在变换了t个元素的情况下,最长公共子序列的长度。初始化之后，对于dp[i][j][t]，如果P[i-1]=Q[j-1]，由于t表示改变t个元素，dp[i][j][t]可能取dp[i-1][j-1][t]+1，在P[i-1]!=Q[j-1]时，dp[i][j][t]可能取dp[i-1][j-1][t-1]+1（需要改变一个元素）。由于dp[i][j][t]还可能取dp[i-1][j][t]和dp[i][j-1][t]，最终结果取最大值。

#ifndef C762_H
#define C762_H
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
    /**
    * @param P: an integer array P
    * @param Q: an integer array Q
    * @param k: the number of allowed changes
    * @return: the length of lca with at most k changes allowed.
    */
    int longestCommonSubsequence2(vector<int> &P, vector<int> &Q, int k) {
        // Write your code here
        if (P.empty() || Q.empty() || k < 0)
            return 0;
        int lenp = P.size(), lenq = Q.size();
        //dp[i][j][t]表示P的前i个数字和Q的前j个数字中,在变换了t个元素的情况下,最长公共子序列的长度
        vector<vector<vector<int>>> dp(lenp + 1, vector<vector<int>>(lenq + 1, vector<int>(k + 1)));
        //当i = 0或j = 0时,dp[i][j][t] = 0
        for (int i = 0; i <= lenp; ++i)
        {
            for (int t = 0; t <= k; ++t)
                dp[i][0][t] = 0;
        }
        for (int j = 0; j <= lenq; ++j)
        {
            for (int t = 0; t <= k; ++t)
                dp[0][j][t] = 0;
        }
        //处理k=0的情况,类似于公共子序列
        for (int i = 1; i <= lenp; ++i)
        {
            for (int j = 1; j <= lenq; ++j)
            {
                if (P[i - 1] == Q[j - 1])
                    dp[i][j][0] = dp[i - 1][j - 1][0] + 1;
                else
                    dp[i][j][0] = maxVal(dp[i - 1][j][0], dp[i][j - 1][0]);
            }
        }
        //若P[i-1]=Q[j-1],不必再变换元素,dp[i][j][t]是dp[i-1][j][t],dp[i][j-1][t],dp[i-1][j-1][t]+1的最大值
        //否则,可能需要变换元素,dp[i][j][t]是dp[i-1][j][t],dp[i][j-1][t],dp[i-1][j-1][t-1]+1的最大值
        for (int i = 1; i <= lenp; ++i)
        {
            for (int j = 1; j <= lenq; ++j)
            {
                for (int t = 1; t <= k; ++t)
                {
                    if (P[i - 1] == Q[j - 1])
                        dp[i][j][t] = maxVal(dp[i - 1][j][t], maxVal(dp[i][j - 1][t], dp[i - 1][j - 1][t] + 1));
                    else
                        dp[i][j][t] = maxVal(dp[i - 1][j][t], maxVal(dp[i][j - 1][t], dp[i - 1][j - 1][t - 1] + 1));
                }
            }
        }
        return dp[lenp][lenq][k];
    }
    int maxVal(int a, int b)
    {
        return a>b ? a : b;
    }
};
#endif