583. Delete Operation for Two Strings
Posted wentiliangkaihua
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了583. Delete Operation for Two Strings相关的知识,希望对你有一定的参考价值。
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.
Example 1:
Input: "sea", "eat" Output: 2 Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
Note:
- The length of given words won‘t exceed 500.
- Characters in given words can only be lower-case letters.
class Solution { public int minDistance(String word1, String word2) { int l1 = word1.length(), l2 = word2.length(); int[][] dp = new int[l1 + 1][l2 + 1]; for(int i = 1; i <= l1; i++) { for(int j = 1; j <= l2; j++) { if(word1.charAt(i - 1) == word2.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 l1 + l2 - 2 * dp[l1][l2]; } }
你品,你细细品,这tmd不就是求LCS吗?求最大公共子序列,然后l1 + l2 - 2*dp[l1][l2]即可
以上是关于583. Delete Operation for Two Strings的主要内容,如果未能解决你的问题,请参考以下文章
583. Delete Operation for Two Strings
583. Delete Operation for Two Strings
[leetcode-583-Delete Operation for Two Strings]
[LeetCode] 583. Delete Operation for Two Strings