# 档案日期2017的43

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

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

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