# 归档 2017年10月

## LeetCode Weekly Contest 55解题报告 作者是 在线疯狂 发布于 2017年10月23日 在 LeetCode.

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

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  715. Range Module

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.

## 题目描述：

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 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 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 ...