Java Program to Implement Longest Common Subsequence Algorithm

This is a Java Program to Implement Longest Common Subsequence Algorithm. This program finds the longest common subsequence between two strings.

Here is the source code of the Java Program to Implement Longest Common Subsequence Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

```
/**
```

 ** Java Program to implement Longest Common Subsequence Algorithm

```
 **/
```
```
 
```
```
import java.io.BufferedReader;
```
```
import java.io.InputStreamReader;
```
```
import java.io.IOException;
```
```
 
```
```
/** Class  LongestCommonSubsequence **/
```
```
public class  LongestCommonSubsequence
```
```
{    
```
```
    /** function lcs **/
```

    public String lcs(String str1, String str2)

```
    {
```
```
        int l1 = str1.length();
```
```
        int l2 = str2.length();
```
```
 
```

        int[][] arr = new int[l1 + 1][l2 + 1];

```
 
```

        for (int i = l1 - 1; i >= 0; i--)

```
        {
```

            for (int j = l2 - 1; j >= 0; j--)

```
            {
```

                if (str1.charAt(i) == str2.charAt(j))

                    arr[i][j] = arr[i + 1][j + 1] + 1;

```
                else 
```

                    arr[i][j] = Math.max(arr[i + 1][j], arr[i][j + 1]);

```
            }
```
```
        }
```
```
 
```
```
        int i = 0, j = 0;
```

        StringBuffer sb = new StringBuffer();

```
        while (i < l1 && j < l2) 
```
```
        {
```

            if (str1.charAt(i) == str2.charAt(j))

```
            {
```

                sb.append(str1.charAt(i));

```
                i++;
```
```
                j++;
```
```
            }
```

            else if (arr[i + 1][j] >= arr[i][j + 1])

```
                i++;
```
```
            else
```
```
                j++;
```
```
        }
```
```
        return sb.toString();
```
```
    }
```
```
 
```
```
    /** Main Function **/
```

    public static void main(String[] args) throws IOException

```
    {    
```

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        System.out.println("Longest Common Subsequence Algorithm Test\n");

```
 
```

        System.out.println("\nEnter string 1");

```
        String str1 = br.readLine();
```
```
 
```

        System.out.println("\nEnter string 2");

```
        String str2 = br.readLine();
```
```
 
```

        LongestCommonSubsequence obj = new LongestCommonSubsequence();

        String result = obj.lcs(str1, str2);

```
 
```

        System.out.println("\nLongest Common Subsequence : "+ result);

```
    }
```
```
}
```

Longest Common Subsequence Algorithm Test
 
 
Enter string 1
longestcommonsubsequence
 
Enter string 2
dynamicprogramming
 
Longest Common Subsequence : ncommn
 
 
 
 
 
Longest Common Subsequence Algorithm Test
 
 
Enter string 1
alphabetagamma
 
Enter string 2
applemangopineapple
 
Longest Common Subsequence : apeaga

Sanfoundry Global Education & Learning Series – 1000 Java Programs.

If you wish to look at all Java Programming examples, go to Java Programs.

If you find any mistake above, kindly email to [email protected]

« Prev - Java Program to Implement K Way Merge Algorithm

» Next - Java Program to Implement Maximum Length Chain of Pairs

Related Posts:

Check Java Books
Check Programming Books
Apply for Java Internship
Practice Programming MCQs
Practice BCA MCQs

Recommended Articles: