【原创】最长公共子序列

dp[i][j] 表示第一个字符串的前i个字符与第二个字符的前j个字符构成的公共子序列的长度

最优子结构：

#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;


class Solution {
public:
    /*
    * @param A: A string
    * @param B: A string
    * @return: The length of longest common subsequence of A and B
    */
    int longestCommonSubsequence(string &A, string &B) {
        // write your code here
        vector<vector<int>> dp(A.size() + 1, vector<int>(B.size() + 1, 0));
        for (int i=1;i<=A.size();i++)
        {
            for (int j=1;j<=B.size();j++)
            {
                if (A[i-1] == B[j-1]) dp[i][j] = dp[i-1][j-1]+1;
                else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        return dp[A.size()][B.size()];
    }
protected:
    inline int max(int a, int b)
    {
        return (a > b) ? a : b;
    }
};





int main()
{

    system("pause");
    return 0;
}