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