LeetCode Weekly Contest 55解题报告

LeetCode Weekly Contest 55是LeetCode举办的第五十九场正式周赛,共4道题目,比赛时长1.5小时。

比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-55/

题解列表:

LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee

LeetCode 712. Minimum ASCII Delete Sum for Two Strings

LeetCode 713. Subarray Product Less ...

继续阅读

[LeetCode]Minimum ASCII Delete Sum for Two Strings

题目描述:

LeetCode 712. 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" ...

继续阅读

年度归档