两个字符串的最小ASCII删除和

/*
 * Problem: Given two strings s1 and s2, return the minimum ASCII sum of deleted characters to make two strings equal.
 * Approach: We use dynamic programming, utilizing Java Streams to simplify operations. The main logic remains similar to the above Java solution, but we use streams to fill the dp array and calculate the minimum deletion sum.
 */
import java.util.stream.IntStream;
public class Solution {
    public int minimumDeleteSum(String s1, String s2) {
        int m = s1.length();
        int n = s2.length();
        int[][] dp = new int[m + 1][n + 1];
        IntStream.range(1, m + 1).forEach(i -> dp[i][0] = dp[i - 1][0] + s1.charAt(i - 1));
        IntStream.range(1, n + 1).forEach(j -> dp[0][j] = dp[0][j - 1] + s2.charAt(j - 1));
        IntStream.range(1, m + 1).forEach(i ->
            IntStream.range(1, n + 1).forEach(j -> {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = Math.min(dp[i - 1][j] + s1.charAt(i - 1), dp[i][j - 1] + s2.charAt(j - 1));
                }
            })
        );
        return dp[m][n];
    }
}