Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class LCSFinder {
- public int longestCommonSubsequence(String x, String y) {
- int n = x.length();
- int m = y.length();
- int[][] dp = new int[n + 1][m + 1];
- for (int i = 1; i <= n; i++) {
- for (int j = 1; j <= m; j++) {
- if (Character.toLowerCase(x.charAt(i - 1)) == Character.toLowerCase(y.charAt(j - 1))) {
- dp[i][j] = dp[i - 1][j - 1] + 1;
- } else {
- dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
- }
- }
- }
- return dp[n][m];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment