Leetcode712. 计算两个字符串删除任意字符后使二者相等的最小删除字符和

obrcnh

于 2017-10-28 20:05:53 发布

阅读量2.3k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode算法文章标签： leetcode

本文链接：https://blog.csdn.net/obrcnh/article/details/78378773

题目讲述了如何通过计算删除字符的ASCII值和找到使两个字符串相等的最小代价。涉及到编辑距离算法，通过动态规划求解。解题分析中给出了算法思想和具体实现的公式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Leetcode712. Minimum ASCII Delete Sum for Two Strings

题目

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 4