LeetCode 877. Stone Game(简单DP)

4 篇文章 0 订阅

Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.

Example 1:

Input: s1 = "sea", s2 = "eat"
Output: 231
Explanation: Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
Deleting "t" from "eat" adds 116 to the sum.
At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.

Example 2:

Input: s1 = "delete", s2 = "leet"
Output: 403
Explanation: Deleting "dee" from "delete" to turn the string into "let",
adds 100[d]+101[e]+101[e] to the sum.  Deleting "e" from "leet" adds 101[e] to the sum.
At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.

Note:

0 < s1.length, s2.length <= 1000.

All elements of each string will have an ASCII value in [97, 122].

解法
很显然的dp题,用二维数组dp[n][m] 表示s1[1…n]到s2[1…m]的最小操作,可以得到如下公式

if s1[i] == s2[j]
	dp[i][j] = min(dp[i][j], dp[i-1][j-1])
else
	dp[i][j] = min3(dp[i][j], dp[i-1][j]+s1[i], dp[i][j-1]+s2[j])

代码

class Solution {
    int dp[1002][1002];
public:
    int minimumDeleteSum(string s1, string s2) {
        int n=s1.size(), m=s2.size();
        for(int i=0;i<=n;i++)
            for(int j=0;j<=m;j++)
                dp[i][j]=(1<<30);
        dp[0][0]=0;
        for(int i=0;i<n;i++)
            dp[i+1][0]=dp[i][0]+s1[i];
        for(int i=0;i<m;i++)
            dp[0][i+1]=dp[0][i]+s2[i];
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++) {
                if(s1[i]==s2[j])
                    dp[i+1][j+1]=min(dp[i+1][j+1], dp[i][j]);
                else 
                    dp[i+1][j+1] = min(dp[i+1][j+1], min(dp[i+1][j]+s2[j], dp[i][j+1]+s1[i]));
            }
        return dp[n][m];
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值