![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LCS
文章平均质量分 51
memcpy0
希望探索文理结合的自由之路。
展开
-
LeetCode C++ 712. Minimum ASCII Delete Sum for Two Strings【动态规划(LCS)】中等
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 "原创 2021-05-21 14:59:22 · 151 阅读 · 0 评论 -
LeetCode C++ 1035. Uncrossed Lines【Dynamic Programming(LCS)】中等
We write the integers of nums1 and nums2 (in the order they are given) on two separate horizontal lines. Now, we may draw connecting lines: a straight line connecting two numbers nums1[i] and nums2[j] such that: nums1[i] == nums2[j]; The line原创 2021-05-21 14:50:40 · 167 阅读 · 0 评论 -
LeetCode C++ 583. Delete Operation for Two Strings【Dynamic Programming(LCS)】中等
Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same. In one step, you can delete exactly one character in either string. Example 1: Input: word1 = "sea", word2 = "eat" Output: 2 Explanation: You n原创 2021-05-21 14:40:08 · 148 阅读 · 0 评论