题目描述：
LeetCode 718. Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.
Example 1:
Input: A: [1,2,3,2,1] B: [3,2,1 ...
[LeetCode]Maximum Length of Repeated Subarray
[LeetCode]String Compression
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 443. String Compression
Given an array of characters, compress it in-place.
The length after compression must always be smaller than or equal to the original array.
Every element of the array should be a character (not int) of ...
[LeetCode]1-bit and 2-bit Characters
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 717. 1-bit and 2-bit Characters
We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).
Now given a string represented by ...
LeetCode Weekly Contest 55解题报告
作者是
发布于
在
LeetCode.
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]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 ...