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 Weekly Contest 55解题报告
[LeetCode]Range Module
作者是
发布于
在
LeetCode.
题目描述：
A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner.
addRange(int left, int right)Adds the half-open interval[left ...
[LeetCode]Subarray Product Less Than K
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 713. Subarray Product Less Than K
Your are given an array of positive integers nums.
Count and print the number of (contiguous) subarrays where the product of all the elements in the subarray is less than k.
Example ...
[LeetCode]Minimum ASCII Delete Sum for Two Strings
作者是
发布于
在
LeetCode.
题目描述：
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" ...
[LeetCode]Best Time to Buy and Sell Stock with Transaction Fee
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative ...