minimum-ascii-delete-sum-for-two-strings

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two strings <code>s1</code> and&nbsp;<code>s2</code>, return the lowest ASCII sum of deleted characters to make two strings equal.

&nbsp;
Example 1:

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

Example 2:

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

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s1.length, s2.length &lt;= 1000</code></li>
	<li><code>s1</code> and <code>s2</code> consist of lowercase English letters.</li>
</ul>

minimumDeleteSum

Minimum ASCII Delete Sum for Two Strings

Edit Distance

edit-distance

编辑距离

Longest Increasing Subsequence

longest-increasing-subsequence

最长递增子序列

Delete Operation for Two Strings

delete-operation-for-two-strings

两个字符串的删除操作

String

Dynamic Programming

给定两个字符串<code>s1</code>&nbsp;和&nbsp;<code>s2</code>，返回 使两个字符串相等所需删除字符的&nbsp;ASCII&nbsp;值的最小和&nbsp;。

&nbsp;

示例 1:

<pre>
输入: s1 = "sea", s2 = "eat"
输出: 231
解释: 在 "sea" 中删除 "s" 并将 "s" 的值(115)加入总和。
在 "eat" 中删除 "t" 并将 116 加入总和。
结束时，两个字符串相等，115 + 116 = 231 就是符合条件的最小和。
</pre>

示例&nbsp;2:

<pre>
输入: s1 = "delete", s2 = "leet"
输出: 403
解释: 在 "delete" 中删除 "dee" 字符串变成 "let"，
将 100[d]+101[e]+101[e] 加入总和。在 "leet" 中删除 "e" 将 101[e] 加入总和。
结束时，两个字符串都等于 "let"，结果即为 100+101+101+101 = 403 。
如果改为将两个字符串转换为 "lee" 或 "eet"，我们会得到 433 或 417 的结果，比答案更大。
</pre>

&nbsp;

提示:

<ul>
	<li><code>0 &lt;= s1.length, s2.length &lt;= 1000</code></li>
	<li><code>s1</code>&nbsp;和&nbsp;<code>s2</code>&nbsp;由小写英文字母组成</li>
</ul>