Solution Class Reference

Public Member Functions
int	longestCommonSubsequence (string text1, string text2)

Detailed Description

Definition at line 5 of file main.cpp.

Member Function Documentation

longestCommonSubsequence()

int Solution::longestCommonSubsequence ( string  text1, string  text2  )

inline

Definition at line 8 of file main.cpp.

    {
        vector<vector<int>> dp((int)text1.size() + 1, vector<int>((int)text2.size() + 1, 0));
        for (int i = (int)text1.size() - 1; i >= 0; --i)
            for (int j = (int)text2.size() - 1; j >= 0; --j)
                if (text1[i] == text2[j])
                    dp[i][j] = 1 + dp[i + 1][j + 1];
                else
                    dp[i][j] = max(dp[i][j + 1], dp[i + 1][j]);
        return dp[0][0];
    }

Referenced by main().

---

The documentation for this class was generated from the following file:

• main.cpp