归档 2017年10月29日

LeetCode Weekly Contest 56解题报告

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

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

题解列表:

LeetCode 717. 1-bit and 2-bit Characters

LeetCode 443. String Compression

LeetCode 718. Maximum Length of Repeated Subarray

LeetCode 719. Find K-th Smallest Pair Distance

[LeetCode]Find K-th Smallest Pair Distance

题目描述:

LeetCode 719. Find K-th Smallest Pair Distance

Given an integer array, return the k-th smallest distance among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.

Example 1 ...

继续阅读

[LeetCode]String Compression

题目描述:

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

继续阅读

昨天

明天

归档