# 归档 2018年1月

## LeetCode Weekly Contest 69解题报告 作者是 在线疯狂 发布于 2018年1月28日 在 LeetCode.

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

LeetCode 771. Jewels and Stones

LeetCode 775. Global and Local Inversions

LeetCode 773. Sliding Puzzle

LeetCode 774. Minimize Max Distance to Gas Station

## 题目描述：

LeetCode 774. Minimize Max Distance to Gas Station

On a horizontal number line, we have gas stations at positions `stations[0], stations[1], ..., stations[N-1]`, where `N = stations.length`.

Now, we add `K` more gas stations so that D ...

## 题目描述：

LeetCode 773. Sliding Puzzle

On a 2x3 `board`, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.

A move consists of choosing `0` and a 4-directionally adjacent number and swapping ...

## 题目描述：

LeetCode 775. Global and Local Inversions

We have some permutation `A` of `[0, 1, ..., N - 1]`, where `N` is the length of `A`.

The number of (global) inversions is the number of `i < j` with `0 <= i ...`

## 题目描述：

LeetCode 771. Jewels and Stones

You're given strings `J` representing the types of stones that are jewels, and `S` representing the stones you have.  Each character in `S` is a type of stone you have.  You want ...