最长公共子序列

// Longest Common Subsequence using Dynamic Programming with Java Streams
// This solution utilizes the same DP approach as above, but with a more functional style using streams.
// The 2D array is initialized and updated similarly to the above method.

import java.util.stream.IntStream;

public class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m + 1][n + 1];
        
        IntStream.range(1, m + 1).forEach(i -> {
            IntStream.range(1, n + 1).forEach(j -> {
                if (text1.charAt(i - 1) == text2.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[m][n];
    }
}