Breaking News: Grepper is joining You.com. Read the official announcement!

find the common longest sub sequence of two string

Anxious Anteater answered on June 29, 2023 Popularity 6/10 Helpfulness 3/10

answer find the common longest sub sequence of two string

related Length longest common substring

find the common longest sub sequence of two string

Comment

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

string longestCommonSubsequence(string s1, string s2) {
    int m = s1.length();
    int n = s2.length();

    vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));

    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            if (s1[i - 1] == s2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
    }

    // Backtrack to construct the LCS
    int i = m, j = n;
    string lcs;
    while (i > 0 && j > 0) {
        if (s1[i - 1] == s2[j - 1]) {
            lcs = s1[i - 1] + lcs;
            i--;
            j--;
        } else if (dp[i - 1][j] > dp[i][j - 1]) {
            i--;
        } else {
            j--;
        }
    }

    return lcs;
}

int main() {
    string s1, s2;
    cout << "Enter the first string: ";
    cin >> s1;
    cout << "Enter the second string: ";
    cin >> s2;

    string result = longestCommonSubsequence(s1, s2);
    cout << "Longest Common Subsequence: " << result << endl;

    return 0;
}

Popularity 6/10 Helpfulness 3/10 Language whatever

Source: chat.openai.com

Tags: find sequence string whatever

Link to this answer
Share Copy Link

Contributed on Jul 24 2023

Anxious Anteater

0 Answers Avg Quality 2/10

Closely Related Answers

Length longest common substring

Comment

using System;
using System.Collections.Generic;

class Program
{
    static int LcsUtil(string s1, string s2, int ind1, int ind2, List<List<int>> dp)
    {
        if (ind1 < 0 || ind2 < 0)
            return 0;

        if (dp[ind1][ind2] != -1)
            return dp[ind1][ind2];

        if (s1[ind1] == s2[ind2])
            return dp[ind1][ind2] = 1 + LcsUtil(s1, s2, ind1 - 1, ind2 - 1, dp);
        else
            return dp[ind1][ind2] = Math.Max(LcsUtil(s1, s2, ind1, ind2 - 1, dp), LcsUtil(s1, s2, ind1 - 1, ind2, dp));
    }

    static int Lcs(string s1, string s2)
    {
        int n = s1.Length;
        int m = s2.Length;

        List<List<int>> dp = new List<List<int>>();
        for (int i = 0; i < n; i++)
        {
            dp.Add(new List<int>());
            for (int j = 0; j < m; j++)
            {
                dp[i].Add(-1);
            }
        }

        return LcsUtil(s1, s2, n - 1, m - 1, dp);
    }

    static void Main(string[] args)
    {
        string s1 = "acd";
        string s2 = "ced";

        Console.WriteLine("The Length of Longest Common Subsequence is " + Lcs(s1, s2));
    }
}

Popularity 9/10 Helpfulness 1/10 Language csharp

Source: chat.openai.com

Tags: substring c#

Link to this answer
Share Copy Link

Contributed on Jun 29 2023

Magnificent Millipede

0 Answers Avg Quality 2/10

find the common longest sub sequence of two string

Contents

More Related Answers

find the common longest sub sequence of two string

Closely Related Answers

Length longest common substring

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.