longest common subsequence in c#

Question

I want to allow users to input their own characters to find the lowest common subsequence, this code is mostly a skeleton of somebody else's work- and the characters used are AGGTAB and GXTXYAB which is GTAB however I want users to implement their own characters

code for longest common subsequence:

class GFG
{
    public static void Main()
    {

        int m = X.Length;
        int n = Y.Length;
        Console.WriteLine("Write down characters for string A");
         string A = Console.ReadLine();
        Console.WriteLine("Write down characters for string B");
        string B = Console.ReadLine();

        int[,] L = new int[m + 1, n + 1];

        for (int i = 0; i <= m; i++)
        {
            for (int j = 0; j <= n; j++)
            {
                if (i == 0 || j == 0)
                    L[i, j] = 0;
                else if (X[i - 1] == Y[j - 1])
                    L[i, j] = L[i - 1, j - 1] + 1;
                else
                    L[i, j] = Math.Max(L[i - 1, j], L[i, j - 1]);
            }
        }
    }
}

i had to cut half the code because stack overflow didnt allow me to post the entire code — ridanaseer, Mar 13 '22 at 13:37
What is your question? Stack Overflow allows you to insert more code than this. Nobody wants to read hundreds of lines of code, but a few dozens are okay. — Olivier Jacot-Descombes, Mar 13 '22 at 13:44
This code makes no sense. You declare `m` and `n` as lengths of something non existent then you use `X` and `Y` that are not even defined and do not use `A` and `B` variables — mrogal.ski, Mar 13 '22 at 13:45
I have never seen SO not letting you insert code and have made > 3500 posts! — Olivier Jacot-Descombes, Mar 14 '22 at 12:17

longest common subsequence in c#

0 Answers0